2 * FILE: d0_bignum-tommath.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
41 #include "d0_bignum.h"
53 static d0_bignum_t temp; // FIXME make threadsafe
58 HCRYPTPROV hCryptProv;
63 void rand_bytes(unsigned char *buf, size_t n)
66 CryptGenRandom(hCryptProv, n, (PBYTE) buf);
70 fread(buf, 1, n, randf);
74 D0_WARN_UNUSED_RESULT D0_BOOL d0_bignum_INITIALIZE(void)
77 unsigned char buf[256];
78 d0_bignum_init(&temp);
81 if(CryptAcquireContext(&hCryptProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT))
84 else if(CryptAcquireContext(&hCryptProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT | CRYPT_NEWKEYSET))
89 fprintf(stderr, "WARNING: could not initialize random number generator (CryptAcquireContext failed)\n");
95 randf = fopen("/dev/urandom", "rb");
97 randf = fopen("/dev/random", "rb");
104 fprintf(stderr, "WARNING: could not initialize random number generator (no random device found)\n");
112 void d0_bignum_SHUTDOWN(void)
114 d0_bignum_clear(&temp);
118 CryptReleaseContext(hCryptProv, 0);
124 D0_BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
126 static __thread unsigned char numbuf[65536];
128 numbuf[0] = (mp_iszero(&bignum->z) ? 0 : (bignum->z.sign == MP_ZPOS) ? 1 : 3);
129 if((numbuf[0] & 3) != 0) // nonzero
131 count = mp_unsigned_bin_size((mp_int *) &bignum->z);
132 if(count > sizeof(numbuf) - 1)
134 mp_to_unsigned_bin((mp_int *) &bignum->z, numbuf+1);
136 return d0_iobuf_write_packet(buf, numbuf, count + 1);
139 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
141 static __thread unsigned char numbuf[65536];
142 size_t count = sizeof(numbuf);
143 if(!d0_iobuf_read_packet(buf, numbuf, &count))
147 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
148 if(numbuf[0] & 3) // nonzero
150 mp_read_unsigned_bin(&bignum->z, numbuf+1, count-1);
151 if(numbuf[0] & 2) // negative
152 bignum->z.sign = MP_NEG;
161 ssize_t d0_bignum_export_unsigned(const d0_bignum_t *bignum, void *buf, size_t bufsize)
163 unsigned long bufsize_;
165 count = mp_unsigned_bin_size((mp_int *) &bignum->z);
170 // pad from left (big endian numbers!)
171 memset(buf, 0, bufsize - count);
172 buf += bufsize - count;
175 mp_to_unsigned_bin_n((mp_int *) &bignum->z, buf, &bufsize_);
180 // mpz_sizeinbase lied to us
182 // there is no sane way whatsoever to handle this
188 // mpz_sizeinbase lied to us
192 memset(buf, 0, count);
196 memmove(buf + count - bufsize, buf, bufsize);
197 memset(buf, 0, count - bufsize);
203 d0_bignum_t *d0_bignum_import_unsigned(d0_bignum_t *bignum, const void *buf, size_t bufsize)
206 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
207 mp_read_unsigned_bin(&bignum->z, buf, bufsize);
211 d0_bignum_t *d0_bignum_new(void)
213 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
218 void d0_bignum_free(d0_bignum_t *a)
224 void d0_bignum_init(d0_bignum_t *b)
229 void d0_bignum_clear(d0_bignum_t *a)
234 size_t d0_bignum_size(const d0_bignum_t *r)
236 return mp_count_bits((mp_int *) &r->z);
239 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
241 return mp_cmp((mp_int *) &a->z, (mp_int *) &b->z);
244 static d0_bignum_t *d0_bignum_rand_0_to_limit(d0_bignum_t *r, const d0_bignum_t *limit)
246 size_t n = d0_bignum_size(limit);
247 size_t b = (n + 7) / 8;
248 unsigned char mask = "\xFF\x7F\x3F\x1F\x0F\x07\x03\x01"[8*b - n];
249 unsigned char numbuf[65536];
250 assert(b <= sizeof(numbuf));
253 rand_bytes(numbuf, b);
255 r = d0_bignum_import_unsigned(r, numbuf, b);
256 if(d0_bignum_cmp(r, limit) < 0)
261 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
263 mp_sub((mp_int *) &max->z, (mp_int *) &min->z, &temp.z);
264 r = d0_bignum_rand_0_to_limit(r, &temp);
265 mp_add((mp_int *) &r->z, (mp_int *) &min->z, &r->z);
269 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
271 if(!d0_bignum_one(&temp))
273 if(!d0_bignum_shl(&temp, &temp, n))
275 r = d0_bignum_rand_0_to_limit(r, &temp);
279 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
281 if(!d0_bignum_one(&temp))
283 if(!d0_bignum_shl(&temp, &temp, n-1))
285 r = d0_bignum_rand_0_to_limit(r, &temp);
286 if(!d0_bignum_add(r, r, &temp))
291 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
293 if(!r) r = d0_bignum_new(); if(!r) return NULL;
298 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
300 return d0_bignum_int(r, 1);
303 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
305 if(!r) r = d0_bignum_new(); if(!r) return NULL;
306 mp_set_int(&r->z, n);
310 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
314 if(!r) r = d0_bignum_new(); if(!r) return NULL;
315 mp_copy((mp_int *) &a->z, &r->z);
319 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
321 if(!r) r = d0_bignum_new(); if(!r) return NULL;
322 mp_neg((mp_int *) &a->z, &r->z);
326 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
328 if(!r) r = d0_bignum_new(); if(!r) return NULL;
330 mp_mul_2d((mp_int *) &a->z, n, &r->z);
332 mp_div_2d((mp_int *) &a->z, -n, &r->z, NULL);
334 mp_copy((mp_int *) &a->z, &r->z);
338 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
340 if(!r) r = d0_bignum_new(); if(!r) return NULL;
341 mp_add((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
345 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
347 if(!r) r = d0_bignum_new(); if(!r) return NULL;
348 mp_sub((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
352 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
354 if(!r) r = d0_bignum_new(); if(!r) return NULL;
355 mp_mul((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
359 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
364 mp_div((mp_int *) &a->z, (mp_int *) &b->z, &q->z, m ? &m->z : NULL);
366 mp_mod((mp_int *) &a->z, (mp_int *) &b->z, &m->z);
373 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)
375 if(!r) r = d0_bignum_new(); if(!r) return NULL;
376 mp_addmod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
380 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)
382 if(!r) r = d0_bignum_new(); if(!r) return NULL;
383 mp_submod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
387 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)
389 if(!r) r = d0_bignum_new(); if(!r) return NULL;
390 mp_mulmod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
394 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)
396 if(!r) r = d0_bignum_new(); if(!r) return NULL;
397 mp_exptmod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
401 D0_BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
403 // here, r MUST be set, as otherwise we cannot return error state!
404 return mp_invmod((mp_int *) &a->z, (mp_int *) &m->z, &r->z) == MP_OKAY;
407 int d0_bignum_isprime(const d0_bignum_t *r, int param)
412 mp_prime_is_prime((mp_int *) &r->z, param, &ret);
416 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)
418 if(!r) r = d0_bignum_new(); if(!r) return NULL;
420 mp_exteuclid((mp_int *) &a->z, (mp_int *) &b->z, s ? &s->z : NULL, t ? &t->z : NULL, &r->z);
422 mp_gcd((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
426 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
428 static __thread char str[65536];
429 mp_toradix_n((mp_int *) &x->z, str, base, sizeof(str));