2 * FILE: d0_bignum-openssl.c
3 * AUTHOR: Rudolf Polzer - divVerent@xonotic.org
5 * Copyright (c) 2010, Rudolf Polzer
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the copyright holder nor the names of contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 /* NOTE: this file links against openssl (http://www.openssl.org), which is
37 * under the OpenSSL License. You may have to abide to its terms too if you use
39 * To alternatively link to GMP, provide the option --without-openssl to
43 #include "d0_bignum.h"
47 #include <openssl/bn.h>
49 // for stupid OpenSSL versions in Mac OS X
50 #ifndef BN_is_negative
51 #define BN_is_negative(a) ((a)->neg != 0)
52 #define BN_set_negative(a,n) ((a)->neg = ((n) && !BN_is_zero(a)))
60 static d0_bignum_t temp;
66 D0_WARN_UNUSED_RESULT D0_BOOL d0_bignum_INITIALIZE(void)
69 d0_bignum_init(&temp);
73 void d0_bignum_SHUTDOWN(void)
75 d0_bignum_clear(&temp);
80 D0_BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
82 static unsigned char numbuf[65536];
84 numbuf[0] = BN_is_zero(&bignum->z) ? 0 : BN_is_negative(&bignum->z) ? 3 : 1;
85 if((numbuf[0] & 3) != 0) // nonzero
87 count = BN_num_bytes(&bignum->z);
88 if(count > sizeof(numbuf) - 1)
90 BN_bn2bin(&bignum->z, numbuf+1);
92 return d0_iobuf_write_packet(buf, numbuf, count + 1);
95 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
97 static unsigned char numbuf[65536];
98 size_t count = sizeof(numbuf);
99 if(!d0_iobuf_read_packet(buf, numbuf, &count))
103 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
104 if(numbuf[0] & 3) // nonzero
106 BN_bin2bn(numbuf+1, count-1, &bignum->z);
107 if(numbuf[0] & 2) // negative
108 BN_set_negative(&bignum->z, 1);
117 ssize_t d0_bignum_export_unsigned(const d0_bignum_t *bignum, void *buf, size_t bufsize)
120 count = BN_num_bytes(&bignum->z);
125 // pad from left (big endian numbers!)
126 memset(buf, 0, bufsize - count);
127 buf += bufsize - count;
129 BN_bn2bin(&bignum->z, buf);
133 d0_bignum_t *d0_bignum_import_unsigned(d0_bignum_t *bignum, const void *buf, size_t bufsize)
136 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
137 BN_bin2bn(buf, bufsize, &bignum->z);
141 d0_bignum_t *d0_bignum_new(void)
143 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
148 void d0_bignum_free(d0_bignum_t *a)
154 void d0_bignum_init(d0_bignum_t *b)
159 void d0_bignum_clear(d0_bignum_t *a)
164 size_t d0_bignum_size(const d0_bignum_t *r)
166 return BN_num_bits(&r->z);
169 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
171 return BN_cmp(&a->z, &b->z);
174 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
176 if(!r) r = d0_bignum_new(); if(!r) return NULL;
177 BN_sub(&temp.z, &max->z, &min->z);
178 BN_rand_range(&r->z, &temp.z);
179 BN_add(&r->z, &r->z, &min->z);
183 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
185 if(!r) r = d0_bignum_new(); if(!r) return NULL;
186 BN_rand(&r->z, n, -1, 0);
190 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
192 if(!r) r = d0_bignum_new(); if(!r) return NULL;
193 BN_rand(&r->z, n, 0, 0);
197 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
199 if(!r) r = d0_bignum_new(); if(!r) return NULL;
204 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
206 if(!r) r = d0_bignum_new(); if(!r) return NULL;
211 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
213 if(!r) r = d0_bignum_new(); if(!r) return NULL;
214 BN_set_word(&r->z, n);
218 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
222 if(!r) r = d0_bignum_new(); if(!r) return NULL;
223 BN_copy(&r->z, &a->z);
227 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
229 if(!r) r = d0_bignum_new(); if(!r) return NULL;
231 BN_copy(&r->z, &a->z);
232 BN_set_negative(&r->z, !BN_is_negative(&r->z));
236 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
238 if(!r) r = d0_bignum_new(); if(!r) return NULL;
240 BN_lshift(&r->z, &a->z, n);
242 BN_rshift(&r->z, &a->z, -n);
244 BN_copy(&r->z, &a->z);
248 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
250 if(!r) r = d0_bignum_new(); if(!r) return NULL;
251 BN_add(&r->z, &a->z, &b->z);
255 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
257 if(!r) r = d0_bignum_new(); if(!r) return NULL;
258 BN_sub(&r->z, &a->z, &b->z);
262 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
264 if(!r) r = d0_bignum_new(); if(!r) return NULL;
265 BN_mul(&r->z, &a->z, &b->z, ctx);
269 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
276 BN_div(&q->z, &m->z, &a->z, &b->z, ctx);
278 BN_div(&q->z, NULL, &a->z, &b->z, ctx);
279 assert(!"I know this code is broken (rounds towards zero), need handle negative correctly");
282 BN_nnmod(&m->z, &a->z, &b->z, ctx);
289 d0_bignum_t *d0_bignum_mod_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b, const d0_bignum_t *m)
291 if(!r) r = d0_bignum_new(); if(!r) return NULL;
292 BN_mod_add(&r->z, &a->z, &b->z, &m->z, ctx);
296 d0_bignum_t *d0_bignum_mod_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b, const d0_bignum_t *m)
298 if(!r) r = d0_bignum_new(); if(!r) return NULL;
299 BN_mod_sub(&r->z, &a->z, &b->z, &m->z, ctx);
303 d0_bignum_t *d0_bignum_mod_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b, const d0_bignum_t *m)
305 if(!r) r = d0_bignum_new(); if(!r) return NULL;
306 BN_mod_mul(&r->z, &a->z, &b->z, &m->z, ctx);
310 d0_bignum_t *d0_bignum_mod_pow(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b, const d0_bignum_t *m)
312 if(!r) r = d0_bignum_new(); if(!r) return NULL;
313 BN_mod_exp(&r->z, &a->z, &b->z, &m->z, ctx);
317 D0_BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
319 // here, r MUST be set, as otherwise we cannot return error state!
320 return !!BN_mod_inverse(&r->z, &a->z, &m->z, ctx);
323 int d0_bignum_isprime(d0_bignum_t *r, int param)
326 return BN_is_prime_fasttest(&r->z, 1, NULL, ctx, NULL, 1);
328 return BN_is_prime(&r->z, param, NULL, ctx, NULL);
331 d0_bignum_t *d0_bignum_gcd(d0_bignum_t *r, d0_bignum_t *s, d0_bignum_t *t, const d0_bignum_t *a, const d0_bignum_t *b)
333 if(!r) r = d0_bignum_new(); if(!r) return NULL;
335 assert(!"Extended gcd not implemented");
337 assert(!"Extended gcd not implemented");
339 BN_gcd(&r->z, &a->z, &b->z, ctx);
343 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
346 return BN_bn2dec(&x->z);
348 return BN_bn2hex(&x->z);
350 assert(!"Other bases not implemented");