2 * FILE: d0_bignum-gmp.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
32 * $Format:commit %H$, $Id$
35 /* NOTE: this file links against libgmp (http://gmplib.org), which is under the
36 * Lesser General Public License 2.1 or later. You may have to abide to its
37 * terms too if you use this file.
38 * To alternatively link to OpenSSL, provide the option --with-openssl to
47 #include "d0_bignum.h"
58 static gmp_randstate_t RANDSTATE;
59 static d0_bignum_t temp;
64 WARN_UNUSED_RESULT BOOL d0_bignum_INITIALIZE(void)
68 unsigned char buf[256];
69 d0_bignum_init(&temp);
70 gmp_randinit_mt(RANDSTATE);
71 gmp_randseed_ui(RANDSTATE, time(NULL));
72 * (time_t *) (&buf[0]) = time(0); // if everything else fails, we use the current time + uninitialized data
75 HCRYPTPROV hCryptProv;
76 if(CryptAcquireContext(&hCryptProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT))
78 if(!CryptGenRandom(hCryptProv, sizeof(buf), (PBYTE) &buf[0]))
80 fprintf(stderr, "WARNING: could not initialize random number generator (CryptGenRandom failed)\n");
83 CryptReleaseContext(hCryptProv, 0);
85 else if(CryptAcquireContext(&hCryptProv, NULL, NULL, PROV_RSA_FULL, CRYPT_VERIFYCONTEXT | CRYPT_NEWKEYSET))
87 if(!CryptGenRandom(hCryptProv, sizeof(buf), (PBYTE) &buf[0]))
89 fprintf(stderr, "WARNING: could not initialize random number generator (CryptGenRandom failed)\n");
92 CryptReleaseContext(hCryptProv, 0);
96 fprintf(stderr, "WARNING: could not initialize random number generator (CryptAcquireContext failed)\n");
101 f = fopen("/dev/urandom", "rb");
103 f = fopen("/dev/random", "rb");
107 if(fread(buf, sizeof(buf), 1, f) != 1)
109 fprintf(stderr, "WARNING: could not initialize random number generator (read from random device failed)\n");
116 fprintf(stderr, "WARNING: could not initialize random number generator (no random device found)\n");
121 mpz_import(temp.z, sizeof(buf), 1, 1, 0, 0, buf);
122 gmp_randseed(RANDSTATE, temp.z);
127 void d0_bignum_SHUTDOWN(void)
129 d0_bignum_clear(&temp);
130 gmp_randclear(RANDSTATE);
133 BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
135 static unsigned char numbuf[65536];
137 numbuf[0] = mpz_sgn(bignum->z) & 3;
138 if((numbuf[0] & 3) != 0) // nonzero
140 count = (mpz_sizeinbase(bignum->z, 2) + 7) / 8;
141 if(count > sizeof(numbuf) - 1)
143 mpz_export(numbuf+1, &count, 1, 1, 0, 0, bignum->z);
145 return d0_iobuf_write_packet(buf, numbuf, count + 1);
148 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
150 static unsigned char numbuf[65536];
151 size_t count = sizeof(numbuf);
152 if(!d0_iobuf_read_packet(buf, numbuf, &count))
156 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
157 if(numbuf[0] & 3) // nonzero
159 mpz_import(bignum->z, count-1, 1, 1, 0, 0, numbuf+1);
160 if(numbuf[0] & 2) // negative
161 mpz_neg(bignum->z, bignum->z);
165 mpz_set_ui(bignum->z, 0);
170 ssize_t d0_bignum_export_unsigned(const d0_bignum_t *bignum, void *buf, size_t bufsize)
173 count = (mpz_sizeinbase(bignum->z, 2) + 7) / 8;
178 // pad from left (big endian numbers!)
179 memset(buf, 0, bufsize - count);
180 buf += bufsize - count;
183 mpz_export(buf, &bufsize, 1, 1, 0, 0, bignum->z);
187 // mpz_sizeinbase lied to us
189 // there is no sane way whatsoever to handle this
195 // mpz_sizeinbase lied to us
199 memset(buf, 0, count);
203 memmove(buf + count - bufsize, buf, bufsize);
204 memset(buf, 0, count - bufsize);
210 d0_bignum_t *d0_bignum_import_unsigned(d0_bignum_t *bignum, const void *buf, size_t bufsize)
213 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
214 mpz_import(bignum->z, bufsize, 1, 1, 0, 0, buf);
218 d0_bignum_t *d0_bignum_new(void)
220 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
225 void d0_bignum_free(d0_bignum_t *a)
231 void d0_bignum_init(d0_bignum_t *b)
236 void d0_bignum_clear(d0_bignum_t *a)
241 size_t d0_bignum_size(const d0_bignum_t *r)
243 return mpz_sizeinbase(r->z, 2);
246 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
248 return mpz_cmp(a->z, b->z);
251 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
253 if(!r) r = d0_bignum_new(); if(!r) return NULL;
254 mpz_sub(temp.z, max->z, min->z);
255 mpz_urandomm(r->z, RANDSTATE, temp.z);
256 mpz_add(r->z, r->z, min->z);
260 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
262 if(!r) r = d0_bignum_new(); if(!r) return NULL;
263 mpz_urandomb(r->z, RANDSTATE, n);
267 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
269 if(!r) r = d0_bignum_new(); if(!r) return NULL;
270 mpz_urandomb(r->z, RANDSTATE, n-1);
271 mpz_setbit(r->z, n-1);
275 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
277 return d0_bignum_int(r, 0);
280 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
282 return d0_bignum_int(r, 1);
285 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
287 if(!r) r = d0_bignum_new(); if(!r) return NULL;
292 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
296 if(!r) r = d0_bignum_new(); if(!r) return NULL;
301 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
303 if(!r) r = d0_bignum_new(); if(!r) return NULL;
308 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
310 if(!r) r = d0_bignum_new(); if(!r) return NULL;
312 mpz_mul_2exp(r->z, a->z, n);
314 mpz_fdiv_q_2exp(r->z, a->z, -n);
320 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
322 if(!r) r = d0_bignum_new(); if(!r) return NULL;
323 mpz_add(r->z, a->z, b->z);
327 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
329 if(!r) r = d0_bignum_new(); if(!r) return NULL;
330 mpz_sub(r->z, a->z, b->z);
334 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
336 if(!r) r = d0_bignum_new(); if(!r) return NULL;
337 mpz_mul(r->z, a->z, b->z);
341 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
347 mpz_fdiv_qr(q->z, m->z, a->z, b->z);
349 mpz_fdiv_q(q->z, a->z, b->z);
351 mpz_fdiv_r(m->z, a->z, b->z);
358 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)
360 r = d0_bignum_add(r, a, b);
361 mpz_fdiv_r(r->z, r->z, m->z);
365 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)
367 r = d0_bignum_mul(r, a, b);
368 mpz_fdiv_r(r->z, r->z, m->z);
372 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)
374 if(!r) r = d0_bignum_new(); if(!r) return NULL;
375 mpz_powm(r->z, a->z, b->z, m->z);
379 BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
381 // here, r MUST be set, as otherwise we cannot return error state!
382 return mpz_invert(r->z, a->z, m->z);
385 int d0_bignum_isprime(d0_bignum_t *r, int param)
387 return mpz_probab_prime_p(r->z, param);
390 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)
392 if(!r) r = d0_bignum_new(); if(!r) return NULL;
394 mpz_gcdext(r->z, s->z, t ? t->z : NULL, a->z, b->z);
396 mpz_gcdext(r->z, t->z, NULL, b->z, a->z);
398 mpz_gcd(r->z, a->z, b->z);
402 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
404 return mpz_get_str(NULL, base, x->z);