2 Blind-ID library for user identification using RSA blind signatures
3 Copyright (C) 2010 Rudolf Polzer
5 This library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 This library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with this library; if not, write to the Free Software
17 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "d0_bignum.h"
29 static gmp_randstate_t RANDSTATE;
30 static d0_bignum_t temp;
34 void d0_bignum_INITIALIZE()
37 d0_bignum_init(&temp);
38 gmp_randinit_mt(RANDSTATE);
39 gmp_randseed_ui(RANDSTATE, time(NULL));
40 f = fopen("/dev/random", "rb");
43 unsigned char buf[256];
44 if(fread(buf, sizeof(buf), 1, f) == 1)
46 mpz_import(temp.z, sizeof(buf), 1, 1, 0, 0, buf);
47 gmp_randseed(RANDSTATE, temp.z);
53 void d0_bignum_SHUTDOWN()
55 d0_bignum_clear(&temp);
56 gmp_randclear(RANDSTATE);
59 BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
61 static unsigned char numbuf[65536];
63 numbuf[0] = mpz_sgn(bignum->z) & 3;
64 if((numbuf[0] & 3) != 0) // nonzero
66 count = (mpz_sizeinbase(bignum->z, 2) + 7) / 8;
67 if(count > sizeof(numbuf) - 1)
69 mpz_export(numbuf+1, &count, 1, 1, 0, 0, bignum->z);
71 return d0_iobuf_write_packet(buf, numbuf, count + 1);
74 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
76 static unsigned char numbuf[65536];
77 size_t count = sizeof(numbuf);
78 if(!d0_iobuf_read_packet(buf, numbuf, &count))
82 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
83 if(numbuf[0] & 3) // nonzero
85 mpz_import(bignum->z, count-1, 1, 1, 0, 0, numbuf+1);
86 if(numbuf[0] & 2) // negative
87 mpz_neg(bignum->z, bignum->z);
91 mpz_set_ui(bignum->z, 0);
96 d0_bignum_t *d0_bignum_new()
98 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
103 void d0_bignum_free(d0_bignum_t *a)
109 void d0_bignum_init(d0_bignum_t *b)
114 void d0_bignum_clear(d0_bignum_t *a)
119 size_t d0_bignum_size(const d0_bignum_t *r)
121 return mpz_sizeinbase(r->z, 2);
124 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
126 return mpz_cmp(a->z, b->z);
129 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
131 if(!r) r = d0_bignum_new(); if(!r) return NULL;
132 mpz_sub(temp.z, max->z, min->z);
133 mpz_urandomm(r->z, RANDSTATE, temp.z);
134 mpz_add(r->z, r->z, min->z);
138 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
140 if(!r) r = d0_bignum_new(); if(!r) return NULL;
141 mpz_urandomb(r->z, RANDSTATE, n);
145 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
147 if(!r) r = d0_bignum_new(); if(!r) return NULL;
148 mpz_urandomb(r->z, RANDSTATE, n-1);
149 mpz_setbit(r->z, n-1);
153 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
155 return d0_bignum_int(r, 0);
158 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
160 return d0_bignum_int(r, 1);
163 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
165 if(!r) r = d0_bignum_new(); if(!r) return NULL;
170 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
174 if(!r) r = d0_bignum_new(); if(!r) return NULL;
179 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
181 if(!r) r = d0_bignum_new(); if(!r) return NULL;
186 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
188 if(!r) r = d0_bignum_new(); if(!r) return NULL;
190 mpz_mul_2exp(r->z, a->z, n);
192 mpz_fdiv_q_2exp(r->z, a->z, -n);
198 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
200 if(!r) r = d0_bignum_new(); if(!r) return NULL;
201 mpz_add(r->z, a->z, b->z);
205 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
207 if(!r) r = d0_bignum_new(); if(!r) return NULL;
208 mpz_sub(r->z, a->z, b->z);
212 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
214 if(!r) r = d0_bignum_new(); if(!r) return NULL;
215 mpz_mul(r->z, a->z, b->z);
219 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
225 mpz_fdiv_qr(q->z, m->z, a->z, b->z);
227 mpz_fdiv_q(q->z, a->z, b->z);
229 mpz_fdiv_r(m->z, a->z, b->z);
236 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)
238 r = d0_bignum_add(r, a, b);
239 mpz_fdiv_r(r->z, r->z, m->z);
243 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)
245 r = d0_bignum_mul(r, a, b);
246 mpz_fdiv_r(r->z, r->z, m->z);
250 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)
252 if(!r) r = d0_bignum_new(); if(!r) return NULL;
253 mpz_powm(r->z, a->z, b->z, m->z);
257 BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
259 // here, r MUST be set, as otherwise we cannot return error state!
260 return mpz_invert(r->z, a->z, m->z);
263 int d0_bignum_isprime(d0_bignum_t *r, int param)
265 return mpz_probab_prime_p(r->z, param);
268 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)
270 if(!r) r = d0_bignum_new(); if(!r) return NULL;
272 mpz_gcdext(r->z, s->z, t ? t->z : NULL, a->z, b->z);
274 mpz_gcdext(r->z, t->z, NULL, b->z, a->z);
276 mpz_gcd(r->z, a->z, b->z);
280 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
282 return mpz_get_str(NULL, base, x->z);