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(void)
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];
45 if(fread(buf, sizeof(buf), 1, f) == 1)
47 mpz_import(temp.z, sizeof(buf), 1, 1, 0, 0, buf);
48 gmp_randseed(RANDSTATE, temp.z);
54 void d0_bignum_SHUTDOWN(void)
56 d0_bignum_clear(&temp);
57 gmp_randclear(RANDSTATE);
60 BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
62 static unsigned char numbuf[65536];
64 numbuf[0] = mpz_sgn(bignum->z) & 3;
65 if((numbuf[0] & 3) != 0) // nonzero
67 count = (mpz_sizeinbase(bignum->z, 2) + 7) / 8;
68 if(count > sizeof(numbuf) - 1)
70 mpz_export(numbuf+1, &count, 1, 1, 0, 0, bignum->z);
72 return d0_iobuf_write_packet(buf, numbuf, count + 1);
75 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
77 static unsigned char numbuf[65536];
78 size_t count = sizeof(numbuf);
79 if(!d0_iobuf_read_packet(buf, numbuf, &count))
83 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
84 if(numbuf[0] & 3) // nonzero
86 mpz_import(bignum->z, count-1, 1, 1, 0, 0, numbuf+1);
87 if(numbuf[0] & 2) // negative
88 mpz_neg(bignum->z, bignum->z);
92 mpz_set_ui(bignum->z, 0);
97 d0_bignum_t *d0_bignum_new(void)
99 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
104 void d0_bignum_free(d0_bignum_t *a)
110 void d0_bignum_init(d0_bignum_t *b)
115 void d0_bignum_clear(d0_bignum_t *a)
120 size_t d0_bignum_size(const d0_bignum_t *r)
122 return mpz_sizeinbase(r->z, 2);
125 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
127 return mpz_cmp(a->z, b->z);
130 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
132 if(!r) r = d0_bignum_new(); if(!r) return NULL;
133 mpz_sub(temp.z, max->z, min->z);
134 mpz_urandomm(r->z, RANDSTATE, temp.z);
135 mpz_add(r->z, r->z, min->z);
139 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
141 if(!r) r = d0_bignum_new(); if(!r) return NULL;
142 mpz_urandomb(r->z, RANDSTATE, n);
146 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
148 if(!r) r = d0_bignum_new(); if(!r) return NULL;
149 mpz_urandomb(r->z, RANDSTATE, n-1);
150 mpz_setbit(r->z, n-1);
154 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
156 return d0_bignum_int(r, 0);
159 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
161 return d0_bignum_int(r, 1);
164 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
166 if(!r) r = d0_bignum_new(); if(!r) return NULL;
171 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
175 if(!r) r = d0_bignum_new(); if(!r) return NULL;
180 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
182 if(!r) r = d0_bignum_new(); if(!r) return NULL;
187 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
189 if(!r) r = d0_bignum_new(); if(!r) return NULL;
191 mpz_mul_2exp(r->z, a->z, n);
193 mpz_fdiv_q_2exp(r->z, a->z, -n);
199 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
201 if(!r) r = d0_bignum_new(); if(!r) return NULL;
202 mpz_add(r->z, a->z, b->z);
206 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
208 if(!r) r = d0_bignum_new(); if(!r) return NULL;
209 mpz_sub(r->z, a->z, b->z);
213 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
215 if(!r) r = d0_bignum_new(); if(!r) return NULL;
216 mpz_mul(r->z, a->z, b->z);
220 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
226 mpz_fdiv_qr(q->z, m->z, a->z, b->z);
228 mpz_fdiv_q(q->z, a->z, b->z);
230 mpz_fdiv_r(m->z, a->z, b->z);
237 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)
239 r = d0_bignum_add(r, a, b);
240 mpz_fdiv_r(r->z, r->z, m->z);
244 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)
246 r = d0_bignum_mul(r, a, b);
247 mpz_fdiv_r(r->z, r->z, m->z);
251 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)
253 if(!r) r = d0_bignum_new(); if(!r) return NULL;
254 mpz_powm(r->z, a->z, b->z, m->z);
258 BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
260 // here, r MUST be set, as otherwise we cannot return error state!
261 return mpz_invert(r->z, a->z, m->z);
264 int d0_bignum_isprime(d0_bignum_t *r, int param)
266 return mpz_probab_prime_p(r->z, param);
269 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)
271 if(!r) r = d0_bignum_new(); if(!r) return NULL;
273 mpz_gcdext(r->z, s->z, t ? t->z : NULL, a->z, b->z);
275 mpz_gcdext(r->z, t->z, NULL, b->z, a->z);
277 mpz_gcd(r->z, a->z, b->z);
281 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
283 return mpz_get_str(NULL, base, x->z);