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>
54 static d0_bignum_t temp;
60 WARN_UNUSED_RESULT BOOL d0_bignum_INITIALIZE(void)
63 d0_bignum_init(&temp);
67 void d0_bignum_SHUTDOWN(void)
69 d0_bignum_clear(&temp);
74 BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
76 static unsigned char numbuf[65536];
78 numbuf[0] = BN_is_zero(&bignum->z) ? 0 : BN_is_negative(&bignum->z) ? 3 : 1;
79 if((numbuf[0] & 3) != 0) // nonzero
81 count = BN_num_bytes(&bignum->z);
82 if(count > sizeof(numbuf) - 1)
84 BN_bn2bin(&bignum->z, numbuf+1);
86 return d0_iobuf_write_packet(buf, numbuf, count + 1);
89 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
91 static unsigned char numbuf[65536];
92 size_t count = sizeof(numbuf);
93 if(!d0_iobuf_read_packet(buf, numbuf, &count))
97 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
98 if(numbuf[0] & 3) // nonzero
100 BN_bin2bn(numbuf+1, count-1, &bignum->z);
101 if(numbuf[0] & 2) // negative
102 BN_set_negative(&bignum->z, 1);
111 ssize_t d0_bignum_export_unsigned(const d0_bignum_t *bignum, void *buf, size_t bufsize)
114 count = BN_num_bytes(&bignum->z);
119 // pad from left (big endian numbers!)
120 memset(buf, 0, bufsize - count);
121 buf += bufsize - count;
123 BN_bn2bin(&bignum->z, buf);
127 d0_bignum_t *d0_bignum_import_unsigned(d0_bignum_t *bignum, const void *buf, size_t bufsize)
130 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
131 BN_bin2bn(buf, bufsize, &bignum->z);
135 d0_bignum_t *d0_bignum_new(void)
137 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
142 void d0_bignum_free(d0_bignum_t *a)
148 void d0_bignum_init(d0_bignum_t *b)
153 void d0_bignum_clear(d0_bignum_t *a)
158 size_t d0_bignum_size(const d0_bignum_t *r)
160 return BN_num_bits(&r->z);
163 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
165 return BN_cmp(&a->z, &b->z);
168 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
170 if(!r) r = d0_bignum_new(); if(!r) return NULL;
171 BN_sub(&temp.z, &max->z, &min->z);
172 BN_rand_range(&r->z, &temp.z);
173 BN_add(&r->z, &r->z, &min->z);
177 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
179 if(!r) r = d0_bignum_new(); if(!r) return NULL;
180 BN_rand(&r->z, n, -1, 0);
184 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
186 if(!r) r = d0_bignum_new(); if(!r) return NULL;
187 BN_rand(&r->z, n, 0, 0);
191 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
193 if(!r) r = d0_bignum_new(); if(!r) return NULL;
198 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
200 if(!r) r = d0_bignum_new(); if(!r) return NULL;
205 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
207 if(!r) r = d0_bignum_new(); if(!r) return NULL;
208 BN_set_word(&r->z, n);
212 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
216 if(!r) r = d0_bignum_new(); if(!r) return NULL;
217 BN_copy(&r->z, &a->z);
221 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
223 if(!r) r = d0_bignum_new(); if(!r) return NULL;
225 BN_copy(&r->z, &a->z);
226 BN_set_negative(&r->z, !BN_is_negative(&r->z));
230 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
232 if(!r) r = d0_bignum_new(); if(!r) return NULL;
234 BN_lshift(&r->z, &a->z, n);
236 BN_rshift(&r->z, &a->z, -n);
238 BN_copy(&r->z, &a->z);
242 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
244 if(!r) r = d0_bignum_new(); if(!r) return NULL;
245 BN_add(&r->z, &a->z, &b->z);
249 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
251 if(!r) r = d0_bignum_new(); if(!r) return NULL;
252 BN_sub(&r->z, &a->z, &b->z);
256 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
258 if(!r) r = d0_bignum_new(); if(!r) return NULL;
259 BN_mul(&r->z, &a->z, &b->z, ctx);
263 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
270 BN_div(&q->z, &m->z, &a->z, &b->z, ctx);
272 BN_div(&q->z, NULL, &a->z, &b->z, ctx);
273 assert(!"I know this code is broken (rounds towards zero), need handle negative correctly");
276 BN_nnmod(&m->z, &a->z, &b->z, ctx);
283 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)
285 if(!r) r = d0_bignum_new(); if(!r) return NULL;
286 BN_mod_add(&r->z, &a->z, &b->z, &m->z, ctx);
290 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)
292 if(!r) r = d0_bignum_new(); if(!r) return NULL;
293 BN_mod_mul(&r->z, &a->z, &b->z, &m->z, ctx);
297 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)
299 if(!r) r = d0_bignum_new(); if(!r) return NULL;
300 BN_mod_exp(&r->z, &a->z, &b->z, &m->z, ctx);
304 BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
306 // here, r MUST be set, as otherwise we cannot return error state!
307 return !!BN_mod_inverse(&r->z, &a->z, &m->z, ctx);
310 int d0_bignum_isprime(d0_bignum_t *r, int param)
312 return BN_is_prime(&r->z, param, NULL, ctx, NULL);
315 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)
317 if(!r) r = d0_bignum_new(); if(!r) return NULL;
319 assert(!"Extended gcd not implemented");
321 assert(!"Extended gcd not implemented");
323 BN_gcd(&r->z, &a->z, &b->z, ctx);
327 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
330 return BN_bn2dec(&x->z);
332 return BN_bn2hex(&x->z);
334 assert(!"Other bases not implemented");