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;
54 static void *tempmutex = NULL; // hold this mutex when using temp
59 HCRYPTPROV hCryptProv;
64 void rand_bytes(unsigned char *buf, size_t n)
67 CryptGenRandom(hCryptProv, n, (PBYTE) buf);
71 fread(buf, 1, n, randf);
75 D0_WARN_UNUSED_RESULT D0_BOOL d0_bignum_INITIALIZE(void)
78 unsigned char buf[256];
80 tempmutex = d0_createmutex();
81 d0_lockmutex(tempmutex);
83 d0_bignum_init(&temp);
86 if(CryptAcquireContext(&hCryptProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT))
89 else if(CryptAcquireContext(&hCryptProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT | CRYPT_NEWKEYSET))
94 fprintf(stderr, "WARNING: could not initialize random number generator (CryptAcquireContext failed)\n");
100 randf = fopen("/dev/urandom", "rb");
102 randf = fopen("/dev/random", "rb");
109 fprintf(stderr, "WARNING: could not initialize random number generator (no random device found)\n");
114 d0_unlockmutex(tempmutex);
119 void d0_bignum_SHUTDOWN(void)
121 d0_lockmutex(tempmutex);
123 d0_bignum_clear(&temp);
127 CryptReleaseContext(hCryptProv, 0);
132 d0_unlockmutex(tempmutex);
133 d0_destroymutex(tempmutex);
137 D0_BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
139 static __thread unsigned char numbuf[65536];
141 numbuf[0] = (mp_iszero(&bignum->z) ? 0 : (bignum->z.sign == MP_ZPOS) ? 1 : 3);
142 if((numbuf[0] & 3) != 0) // nonzero
144 count = mp_unsigned_bin_size((mp_int *) &bignum->z);
145 if(count > sizeof(numbuf) - 1)
147 mp_to_unsigned_bin((mp_int *) &bignum->z, numbuf+1);
149 return d0_iobuf_write_packet(buf, numbuf, count + 1);
152 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
154 static __thread unsigned char numbuf[65536];
155 size_t count = sizeof(numbuf);
156 if(!d0_iobuf_read_packet(buf, numbuf, &count))
160 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
161 if(numbuf[0] & 3) // nonzero
163 mp_read_unsigned_bin(&bignum->z, numbuf+1, count-1);
164 if(numbuf[0] & 2) // negative
165 bignum->z.sign = MP_NEG;
174 ssize_t d0_bignum_export_unsigned(const d0_bignum_t *bignum, void *buf, size_t bufsize)
176 unsigned long bufsize_;
178 count = mp_unsigned_bin_size((mp_int *) &bignum->z);
183 // pad from left (big endian numbers!)
184 memset(buf, 0, bufsize - count);
185 buf += bufsize - count;
188 mp_to_unsigned_bin_n((mp_int *) &bignum->z, buf, &bufsize_);
193 // mpz_sizeinbase lied to us
195 // there is no sane way whatsoever to handle this
201 // mpz_sizeinbase lied to us
205 memset(buf, 0, count);
209 memmove(buf + count - bufsize, buf, bufsize);
210 memset(buf, 0, count - bufsize);
216 d0_bignum_t *d0_bignum_import_unsigned(d0_bignum_t *bignum, const void *buf, size_t bufsize)
219 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
220 mp_read_unsigned_bin(&bignum->z, buf, bufsize);
224 d0_bignum_t *d0_bignum_new(void)
226 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
231 void d0_bignum_free(d0_bignum_t *a)
237 void d0_bignum_init(d0_bignum_t *b)
242 void d0_bignum_clear(d0_bignum_t *a)
247 size_t d0_bignum_size(const d0_bignum_t *r)
249 return mp_count_bits((mp_int *) &r->z);
252 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
254 return mp_cmp((mp_int *) &a->z, (mp_int *) &b->z);
257 static d0_bignum_t *d0_bignum_rand_0_to_limit(d0_bignum_t *r, const d0_bignum_t *limit)
259 size_t n = d0_bignum_size(limit);
260 size_t b = (n + 7) / 8;
261 unsigned char mask = "\xFF\x7F\x3F\x1F\x0F\x07\x03\x01"[8*b - n];
262 unsigned char numbuf[65536];
263 assert(b <= sizeof(numbuf));
266 rand_bytes(numbuf, b);
268 r = d0_bignum_import_unsigned(r, numbuf, b);
269 if(d0_bignum_cmp(r, limit) < 0)
274 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
276 d0_lockmutex(tempmutex);
277 mp_sub((mp_int *) &max->z, (mp_int *) &min->z, &temp.z);
278 r = d0_bignum_rand_0_to_limit(r, &temp);
279 d0_unlockmutex(tempmutex);
280 mp_add((mp_int *) &r->z, (mp_int *) &min->z, &r->z);
284 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
286 d0_lockmutex(tempmutex);
287 if(!d0_bignum_one(&temp))
289 d0_unlockmutex(tempmutex);
292 if(!d0_bignum_shl(&temp, &temp, n))
294 d0_unlockmutex(tempmutex);
297 r = d0_bignum_rand_0_to_limit(r, &temp);
298 d0_unlockmutex(tempmutex);
302 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
304 d0_lockmutex(tempmutex);
305 if(!d0_bignum_one(&temp))
307 d0_unlockmutex(tempmutex);
310 if(!d0_bignum_shl(&temp, &temp, n-1))
312 d0_unlockmutex(tempmutex);
315 r = d0_bignum_rand_0_to_limit(r, &temp);
316 if(!d0_bignum_add(r, r, &temp))
318 d0_unlockmutex(tempmutex);
321 d0_unlockmutex(tempmutex);
325 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
327 if(!r) r = d0_bignum_new(); if(!r) return NULL;
332 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
334 return d0_bignum_int(r, 1);
337 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
339 if(!r) r = d0_bignum_new(); if(!r) return NULL;
340 mp_set_int(&r->z, n);
344 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
348 if(!r) r = d0_bignum_new(); if(!r) return NULL;
349 mp_copy((mp_int *) &a->z, &r->z);
353 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
355 if(!r) r = d0_bignum_new(); if(!r) return NULL;
356 mp_neg((mp_int *) &a->z, &r->z);
360 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
362 if(!r) r = d0_bignum_new(); if(!r) return NULL;
364 mp_mul_2d((mp_int *) &a->z, n, &r->z);
366 mp_div_2d((mp_int *) &a->z, -n, &r->z, NULL);
368 mp_copy((mp_int *) &a->z, &r->z);
372 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
374 if(!r) r = d0_bignum_new(); if(!r) return NULL;
375 mp_add((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
379 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
381 if(!r) r = d0_bignum_new(); if(!r) return NULL;
382 mp_sub((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
386 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
388 if(!r) r = d0_bignum_new(); if(!r) return NULL;
389 mp_mul((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
393 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
398 mp_div((mp_int *) &a->z, (mp_int *) &b->z, &q->z, m ? &m->z : NULL);
400 mp_mod((mp_int *) &a->z, (mp_int *) &b->z, &m->z);
407 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)
409 if(!r) r = d0_bignum_new(); if(!r) return NULL;
410 mp_addmod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
414 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)
416 if(!r) r = d0_bignum_new(); if(!r) return NULL;
417 mp_submod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
421 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)
423 if(!r) r = d0_bignum_new(); if(!r) return NULL;
424 mp_mulmod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
428 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)
430 if(!r) r = d0_bignum_new(); if(!r) return NULL;
431 mp_exptmod((mp_int *) &a->z, (mp_int *) &b->z, (mp_int *) &m->z, &r->z);
435 D0_BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
437 // here, r MUST be set, as otherwise we cannot return error state!
438 return mp_invmod((mp_int *) &a->z, (mp_int *) &m->z, &r->z) == MP_OKAY;
441 int d0_bignum_isprime(const d0_bignum_t *r, int param)
446 mp_prime_is_prime((mp_int *) &r->z, param, &ret);
450 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)
452 if(!r) r = d0_bignum_new(); if(!r) return NULL;
454 mp_exteuclid((mp_int *) &a->z, (mp_int *) &b->z, s ? &s->z : NULL, t ? &t->z : NULL, &r->z);
456 mp_gcd((mp_int *) &a->z, (mp_int *) &b->z, &r->z);
460 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
462 static __thread char str[65536];
463 mp_toradix_n((mp_int *) &x->z, str, base, sizeof(str));