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;
32 void d0_bignum_INITIALIZE()
34 gmp_randinit_default(RANDSTATE);
35 gmp_randseed_ui(RANDSTATE, time(NULL)); // TODO seed
38 void d0_bignum_SHUTDOWN()
43 BOOL d0_iobuf_write_bignum(d0_iobuf_t *buf, const d0_bignum_t *bignum)
45 static unsigned char numbuf[65536];
47 numbuf[0] = mpz_sgn(bignum->z) & 3;
48 if((numbuf[0] & 3) != 0) // nonzero
50 count = (mpz_sizeinbase(bignum->z, 2) + 7) / 8;
51 if(count > sizeof(numbuf) - 1)
53 mpz_export(numbuf+1, &count, 1, 1, 0, 0, bignum->z);
55 return d0_iobuf_write_packet(buf, numbuf, count + 1);
58 d0_bignum_t *d0_iobuf_read_bignum(d0_iobuf_t *buf, d0_bignum_t *bignum)
60 static unsigned char numbuf[65536];
61 size_t count = sizeof(numbuf);
62 if(!d0_iobuf_read_packet(buf, numbuf, &count))
66 if(!bignum) bignum = d0_bignum_new(); if(!bignum) return NULL;
67 if(numbuf[0] & 3) // nonzero
69 mpz_import(bignum->z, count-1, 1, 1, 0, 0, numbuf+1);
70 if(numbuf[0] & 2) // negative
71 mpz_neg(bignum->z, bignum->z);
75 mpz_set_ui(bignum->z, 0);
80 d0_bignum_t *d0_bignum_new()
82 d0_bignum_t *b = d0_malloc(sizeof(d0_bignum_t));
87 void d0_bignum_free(d0_bignum_t *a)
93 void d0_bignum_init(d0_bignum_t *b)
98 void d0_bignum_clear(d0_bignum_t *a)
103 size_t d0_bignum_size(const d0_bignum_t *r)
105 return mpz_sizeinbase(r->z, 2);
108 int d0_bignum_cmp(const d0_bignum_t *a, const d0_bignum_t *b)
110 return mpz_cmp(a->z, b->z);
113 d0_bignum_t *d0_bignum_rand_range(d0_bignum_t *r, const d0_bignum_t *min, const d0_bignum_t *max)
115 static d0_bignum_t *temp = NULL; if(!temp) temp = d0_bignum_new();
116 if(!r) r = d0_bignum_new(); if(!r) return NULL;
117 mpz_sub(temp->z, max->z, min->z);
118 mpz_urandomm(r->z, RANDSTATE, temp->z);
119 mpz_add(r->z, r->z, min->z);
123 d0_bignum_t *d0_bignum_rand_bit_atmost(d0_bignum_t *r, size_t n)
125 if(!r) r = d0_bignum_new(); if(!r) return NULL;
126 mpz_urandomb(r->z, RANDSTATE, n);
130 d0_bignum_t *d0_bignum_rand_bit_exact(d0_bignum_t *r, size_t n)
132 if(!r) r = d0_bignum_new(); if(!r) return NULL;
133 mpz_urandomb(r->z, RANDSTATE, n-1);
134 mpz_setbit(r->z, n-1);
138 d0_bignum_t *d0_bignum_zero(d0_bignum_t *r)
140 return d0_bignum_int(r, 0);
143 d0_bignum_t *d0_bignum_one(d0_bignum_t *r)
145 return d0_bignum_int(r, 1);
148 d0_bignum_t *d0_bignum_int(d0_bignum_t *r, int n)
150 if(!r) r = d0_bignum_new(); if(!r) return NULL;
155 d0_bignum_t *d0_bignum_mov(d0_bignum_t *r, const d0_bignum_t *a)
159 if(!r) r = d0_bignum_new(); if(!r) return NULL;
164 d0_bignum_t *d0_bignum_neg(d0_bignum_t *r, const d0_bignum_t *a)
166 if(!r) r = d0_bignum_new(); if(!r) return NULL;
171 d0_bignum_t *d0_bignum_shl(d0_bignum_t *r, const d0_bignum_t *a, ssize_t n)
173 if(!r) r = d0_bignum_new(); if(!r) return NULL;
175 mpz_mul_2exp(r->z, a->z, n);
177 mpz_fdiv_q_2exp(r->z, a->z, -n);
183 d0_bignum_t *d0_bignum_add(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
185 if(!r) r = d0_bignum_new(); if(!r) return NULL;
186 mpz_add(r->z, a->z, b->z);
190 d0_bignum_t *d0_bignum_sub(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
192 if(!r) r = d0_bignum_new(); if(!r) return NULL;
193 mpz_sub(r->z, a->z, b->z);
197 d0_bignum_t *d0_bignum_mul(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *b)
199 if(!r) r = d0_bignum_new(); if(!r) return NULL;
200 mpz_mul(r->z, a->z, b->z);
204 d0_bignum_t *d0_bignum_divmod(d0_bignum_t *q, d0_bignum_t *m, const d0_bignum_t *a, const d0_bignum_t *b)
210 mpz_fdiv_qr(q->z, m->z, a->z, b->z);
212 mpz_fdiv_q(q->z, a->z, b->z);
214 mpz_fdiv_r(m->z, a->z, b->z);
221 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)
223 r = d0_bignum_add(r, a, b);
224 mpz_fdiv_r(r->z, r->z, m->z);
228 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)
230 r = d0_bignum_mul(r, a, b);
231 mpz_fdiv_r(r->z, r->z, m->z);
235 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)
237 if(!r) r = d0_bignum_new(); if(!r) return NULL;
238 mpz_powm(r->z, a->z, b->z, m->z);
242 BOOL d0_bignum_mod_inv(d0_bignum_t *r, const d0_bignum_t *a, const d0_bignum_t *m)
244 // here, r MUST be set, as otherwise we cannot return error state!
245 return mpz_invert(r->z, a->z, m->z);
248 int d0_bignum_isprime(d0_bignum_t *r, int param)
250 return mpz_probab_prime_p(r->z, param);
253 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)
255 if(!r) r = d0_bignum_new(); if(!r) return NULL;
257 mpz_gcdext(r->z, s->z, t ? t->z : NULL, a->z, b->z);
259 mpz_gcdext(r->z, t->z, NULL, b->z, a->z);
261 mpz_gcd(r->z, a->z, b->z);
265 char *d0_bignum_tostring(const d0_bignum_t *x, unsigned int base)
267 return mpz_get_str(NULL, base, x->z);