11 typedef void ecc_point;
18 /** math descriptor */
20 /** Name of the math provider */
23 /** Bits per digit, amount of bits must fit in an unsigned long */
26 /* ---- init/deinit functions ---- */
28 /** initialize a bignum
29 @param a The number to initialize
30 @return CRYPT_OK on success
32 int (*init)(void **a);
35 @param dst The number to initialize and write to
36 @param src The number to copy from
37 @return CRYPT_OK on success
39 int (*init_copy)(void **dst, void *src);
42 @param a The number to free
43 @return CRYPT_OK on success
45 void (*deinit)(void *a);
47 /* ---- data movement ---- */
50 @param src The number to negate
51 @param dst The destination
52 @return CRYPT_OK on success
54 int (*neg)(void *src, void *dst);
57 @param src The number to copy from
58 @param dst The number to write to
59 @return CRYPT_OK on success
61 int (*copy)(void *src, void *dst);
63 /* ---- trivial low level functions ---- */
65 /** set small constant
66 @param a Number to write to
67 @param n Source upto bits_per_digit (actually meant for very small constants)
68 @return CRYPT_OK on succcess
70 int (*set_int)(void *a, unsigned long n);
72 /** get small constant
73 @param a Number to read, only fetches upto bits_per_digit from the number
74 @return The lower bits_per_digit of the integer (unsigned)
76 unsigned long (*get_int)(void *a);
79 @param a The number to read from
80 @param n The number of the digit to fetch
81 @return The bits_per_digit sized n'th digit of a
83 unsigned long (*get_digit)(void *a, int n);
85 /** Get the number of digits that represent the number
86 @param a The number to count
87 @return The number of digits used to represent the number
89 int (*get_digit_count)(void *a);
91 /** compare two integers
92 @param a The left side integer
93 @param b The right side integer
94 @return LTC_MP_LT if a < b, LTC_MP_GT if a > b and LTC_MP_EQ otherwise. (signed comparison)
96 int (*compare)(void *a, void *b);
98 /** compare against int
99 @param a The left side integer
100 @param b The right side integer (upto bits_per_digit)
101 @return LTC_MP_LT if a < b, LTC_MP_GT if a > b and LTC_MP_EQ otherwise. (signed comparison)
103 int (*compare_d)(void *a, unsigned long n);
105 /** Count the number of bits used to represent the integer
106 @param a The integer to count
107 @return The number of bits required to represent the integer
109 int (*count_bits)(void * a);
111 /** Count the number of LSB bits which are zero
112 @param a The integer to count
113 @return The number of contiguous zero LSB bits
115 int (*count_lsb_bits)(void *a);
117 /** Compute a power of two
118 @param a The integer to store the power in
119 @param n The power of two you want to store (a = 2^n)
120 @return CRYPT_OK on success
122 int (*twoexpt)(void *a , int n);
124 /* ---- radix conversions ---- */
126 /** read ascii string
127 @param a The integer to store into
128 @param str The string to read
129 @param radix The radix the integer has been represented in (2-64)
130 @return CRYPT_OK on success
132 int (*read_radix)(void *a, const char *str, int radix);
134 /** write number to string
135 @param a The integer to store
136 @param str The destination for the string
137 @param radix The radix the integer is to be represented in (2-64)
138 @return CRYPT_OK on success
140 int (*write_radix)(void *a, char *str, int radix);
142 /** get size as unsigned char string
143 @param a The integer to get the size (when stored in array of octets)
144 @return The length of the integer
146 unsigned long (*unsigned_size)(void *a);
148 /** store an integer as an array of octets
149 @param src The integer to store
150 @param dst The buffer to store the integer in
151 @return CRYPT_OK on success
153 int (*unsigned_write)(void *src, unsigned char *dst);
155 /** read an array of octets and store as integer
156 @param dst The integer to load
157 @param src The array of octets
158 @param len The number of octets
159 @return CRYPT_OK on success
161 int (*unsigned_read)(void *dst, unsigned char *src, unsigned long len);
163 /* ---- basic math ---- */
166 @param a The first source integer
167 @param b The second source integer
168 @param c The destination of "a + b"
169 @return CRYPT_OK on success
171 int (*add)(void *a, void *b, void *c);
175 @param a The first source integer
176 @param b The second source integer (single digit of upto bits_per_digit in length)
177 @param c The destination of "a + b"
178 @return CRYPT_OK on success
180 int (*addi)(void *a, unsigned long b, void *c);
182 /** subtract two integers
183 @param a The first source integer
184 @param b The second source integer
185 @param c The destination of "a - b"
186 @return CRYPT_OK on success
188 int (*sub)(void *a, void *b, void *c);
190 /** subtract two integers
191 @param a The first source integer
192 @param b The second source integer (single digit of upto bits_per_digit in length)
193 @param c The destination of "a - b"
194 @return CRYPT_OK on success
196 int (*subi)(void *a, unsigned long b, void *c);
198 /** multiply two integers
199 @param a The first source integer
200 @param b The second source integer (single digit of upto bits_per_digit in length)
201 @param c The destination of "a * b"
202 @return CRYPT_OK on success
204 int (*mul)(void *a, void *b, void *c);
206 /** multiply two integers
207 @param a The first source integer
208 @param b The second source integer (single digit of upto bits_per_digit in length)
209 @param c The destination of "a * b"
210 @return CRYPT_OK on success
212 int (*muli)(void *a, unsigned long b, void *c);
214 /** Square an integer
215 @param a The integer to square
216 @param b The destination
217 @return CRYPT_OK on success
219 int (*sqr)(void *a, void *b);
221 /** Divide an integer
222 @param a The dividend
224 @param c The quotient (can be NULL to signify don't care)
225 @param d The remainder (can be NULL to signify don't care)
226 @return CRYPT_OK on success
228 int (*mpdiv)(void *a, void *b, void *c, void *d);
231 @param a The integer to divide (shift right)
232 @param b The destination
233 @return CRYPT_OK on success
235 int (*div_2)(void *a, void *b);
237 /** Get remainder (small value)
238 @param a The integer to reduce
239 @param b The modulus (upto bits_per_digit in length)
240 @param c The destination for the residue
241 @return CRYPT_OK on success
243 int (*modi)(void *a, unsigned long b, unsigned long *c);
246 @param a The first integer
247 @param b The second integer
248 @param c The destination for (a, b)
249 @return CRYPT_OK on success
251 int (*gcd)(void *a, void *b, void *c);
254 @param a The first integer
255 @param b The second integer
256 @param c The destination for [a, b]
257 @return CRYPT_OK on success
259 int (*lcm)(void *a, void *b, void *c);
261 /** Modular multiplication
262 @param a The first source
263 @param b The second source
265 @param d The destination (a*b mod c)
266 @return CRYPT_OK on success
268 int (*mulmod)(void *a, void *b, void *c, void *d);
271 @param a The first source
273 @param c The destination (a*a mod b)
274 @return CRYPT_OK on success
276 int (*sqrmod)(void *a, void *b, void *c);
278 /** Modular inversion
279 @param a The value to invert
281 @param c The destination (1/a mod b)
282 @return CRYPT_OK on success
284 int (*invmod)(void *, void *, void *);
286 /* ---- reduction ---- */
290 @param b The destination for the reduction digit
291 @return CRYPT_OK on success
293 int (*montgomery_setup)(void *a, void **b);
295 /** get normalization value
296 @param a The destination for the normalization value
298 @return CRYPT_OK on success
300 int (*montgomery_normalization)(void *a, void *b);
303 @param a The number [and dest] to reduce
305 @param c The value "b" from montgomery_setup()
306 @return CRYPT_OK on success
308 int (*montgomery_reduce)(void *a, void *b, void *c);
310 /** clean up (frees memory)
311 @param a The value "b" from montgomery_setup()
312 @return CRYPT_OK on success
314 void (*montgomery_deinit)(void *a);
316 /* ---- exponentiation ---- */
318 /** Modular exponentiation
319 @param a The base integer
320 @param b The power (can be negative) integer
321 @param c The modulus integer
322 @param d The destination
323 @return CRYPT_OK on success
325 int (*exptmod)(void *a, void *b, void *c, void *d);
327 /** Primality testing
328 @param a The integer to test
329 @param b The destination of the result (FP_YES if prime)
330 @return CRYPT_OK on success
332 int (*isprime)(void *a, int *b);
334 /* ---- (optional) ecc point math ---- */
336 /** ECC GF(p) point multiplication (from the NIST curves)
337 @param k The integer to multiply the point by
338 @param G The point to multiply
339 @param R The destination for kG
340 @param modulus The modulus for the field
341 @param map Boolean indicated whether to map back to affine or not (can be ignored if you work in affine only)
342 @return CRYPT_OK on success
344 int (*ecc_ptmul)(void *k, ecc_point *G, ecc_point *R, void *modulus, int map);
346 /** ECC GF(p) point addition
347 @param P The first point
348 @param Q The second point
349 @param R The destination of P + Q
350 @param modulus The modulus
351 @param mp The "b" value from montgomery_setup()
352 @return CRYPT_OK on success
354 int (*ecc_ptadd)(ecc_point *P, ecc_point *Q, ecc_point *R, void *modulus, void *mp);
356 /** ECC GF(p) point double
357 @param P The first point
358 @param R The destination of 2P
359 @param modulus The modulus
360 @param mp The "b" value from montgomery_setup()
361 @return CRYPT_OK on success
363 int (*ecc_ptdbl)(ecc_point *P, ecc_point *R, void *modulus, void *mp);
365 /** ECC mapping from projective to affine, currently uses (x,y,z) => (x/z^2, y/z^3, 1)
366 @param P The point to map
367 @param modulus The modulus
368 @param mp The "b" value from montgomery_setup()
369 @return CRYPT_OK on success
370 @remark The mapping can be different but keep in mind a ecc_point only has three
371 integers (x,y,z) so if you use a different mapping you have to make it fit.
373 int (*ecc_map)(ecc_point *P, void *modulus, void *mp);
375 /** Computes kA*A + kB*B = C using Shamir's Trick
376 @param A First point to multiply
377 @param kA What to multiple A by
378 @param B Second point to multiply
379 @param kB What to multiple B by
380 @param C [out] Destination point (can overlap with A or B
381 @param modulus Modulus for curve
382 @return CRYPT_OK on success
384 int (*ecc_mul2add)(ecc_point *A, void *kA,
385 ecc_point *B, void *kB,
389 /* ---- (optional) rsa optimized math (for internal CRT) ---- */
391 /** RSA Key Generation
392 @param prng An active PRNG state
393 @param wprng The index of the PRNG desired
394 @param size The size of the modulus (key size) desired (octets)
395 @param e The "e" value (public key). e==65537 is a good choice
396 @param key [out] Destination of a newly created private key pair
397 @return CRYPT_OK if successful, upon error all allocated ram is freed
399 int (*rsa_keygen)(prng_state *prng, int wprng, int size, long e, rsa_key *key);
402 /** RSA exponentiation
403 @param in The octet array representing the base
404 @param inlen The length of the input
405 @param out The destination (to be stored in an octet array format)
406 @param outlen The length of the output buffer and the resulting size (zero padded to the size of the modulus)
407 @param which PK_PUBLIC for public RSA and PK_PRIVATE for private RSA
408 @param key The RSA key to use
409 @return CRYPT_OK on success
411 int (*rsa_me)(const unsigned char *in, unsigned long inlen,
412 unsigned char *out, unsigned long *outlen, int which,
414 } ltc_math_descriptor;
416 extern ltc_math_descriptor ltc_mp;
418 int ltc_init_multi(void **a, ...);
419 void ltc_deinit_multi(void *a, ...);
422 extern const ltc_math_descriptor ltm_desc;
426 extern const ltc_math_descriptor tfm_desc;
430 extern const ltc_math_descriptor gmp_desc;
433 #if !defined(DESC_DEF_ONLY) && defined(LTC_SOURCE)
435 #define MP_DIGIT_BIT ltc_mp.bits_per_digit
437 /* some handy macros */
438 #define mp_init(a) ltc_mp.init(a)
439 #define mp_init_multi ltc_init_multi
440 #define mp_clear(a) ltc_mp.deinit(a)
441 #define mp_clear_multi ltc_deinit_multi
442 #define mp_init_copy(a, b) ltc_mp.init_copy(a, b)
444 #define mp_neg(a, b) ltc_mp.neg(a, b)
445 #define mp_copy(a, b) ltc_mp.copy(a, b)
447 #define mp_set(a, b) ltc_mp.set_int(a, b)
448 #define mp_set_int(a, b) ltc_mp.set_int(a, b)
449 #define mp_get_int(a) ltc_mp.get_int(a)
450 #define mp_get_digit(a, n) ltc_mp.get_digit(a, n)
451 #define mp_get_digit_count(a) ltc_mp.get_digit_count(a)
452 #define mp_cmp(a, b) ltc_mp.compare(a, b)
453 #define mp_cmp_d(a, b) ltc_mp.compare_d(a, b)
454 #define mp_count_bits(a) ltc_mp.count_bits(a)
455 #define mp_cnt_lsb(a) ltc_mp.count_lsb_bits(a)
456 #define mp_2expt(a, b) ltc_mp.twoexpt(a, b)
458 #define mp_read_radix(a, b, c) ltc_mp.read_radix(a, b, c)
459 #define mp_toradix(a, b, c) ltc_mp.write_radix(a, b, c)
460 #define mp_unsigned_bin_size(a) ltc_mp.unsigned_size(a)
461 #define mp_to_unsigned_bin(a, b) ltc_mp.unsigned_write(a, b)
462 #define mp_read_unsigned_bin(a, b, c) ltc_mp.unsigned_read(a, b, c)
464 #define mp_add(a, b, c) ltc_mp.add(a, b, c)
465 #define mp_add_d(a, b, c) ltc_mp.addi(a, b, c)
466 #define mp_sub(a, b, c) ltc_mp.sub(a, b, c)
467 #define mp_sub_d(a, b, c) ltc_mp.subi(a, b, c)
468 #define mp_mul(a, b, c) ltc_mp.mul(a, b, c)
469 #define mp_mul_d(a, b, c) ltc_mp.muli(a, b, c)
470 #define mp_sqr(a, b) ltc_mp.sqr(a, b)
471 #define mp_div(a, b, c, d) ltc_mp.mpdiv(a, b, c, d)
472 #define mp_div_2(a, b) ltc_mp.div_2(a, b)
473 #define mp_mod(a, b, c) ltc_mp.mpdiv(a, b, NULL, c)
474 #define mp_mod_d(a, b, c) ltc_mp.modi(a, b, c)
475 #define mp_gcd(a, b, c) ltc_mp.gcd(a, b, c)
476 #define mp_lcm(a, b, c) ltc_mp.lcm(a, b, c)
478 #define mp_mulmod(a, b, c, d) ltc_mp.mulmod(a, b, c, d)
479 #define mp_sqrmod(a, b, c) ltc_mp.sqrmod(a, b, c)
480 #define mp_invmod(a, b, c) ltc_mp.invmod(a, b, c)
482 #define mp_montgomery_setup(a, b) ltc_mp.montgomery_setup(a, b)
483 #define mp_montgomery_normalization(a, b) ltc_mp.montgomery_normalization(a, b)
484 #define mp_montgomery_reduce(a, b, c) ltc_mp.montgomery_reduce(a, b, c)
485 #define mp_montgomery_free(a) ltc_mp.montgomery_deinit(a)
487 #define mp_exptmod(a,b,c,d) ltc_mp.exptmod(a,b,c,d)
488 #define mp_prime_is_prime(a, b, c) ltc_mp.isprime(a, c)
490 #define mp_iszero(a) (mp_cmp_d(a, 0) == LTC_MP_EQ ? LTC_MP_YES : LTC_MP_NO)
491 #define mp_isodd(a) (mp_get_digit_count(a) > 0 ? (mp_get_digit(a, 0) & 1 ? LTC_MP_YES : LTC_MP_NO) : LTC_MP_NO)
492 #define mp_exch(a, b) do { void *ABC__tmp = a; a = b; b = ABC__tmp; } while(0);
494 #define mp_tohex(a, b) mp_toradix(a, b, 16)
498 /* $Source: /cvs/libtom/libtomcrypt/src/headers/tomcrypt_math.h,v $ */
499 /* $Revision: 1.43 $ */
500 /* $Date: 2006/12/02 19:23:13 $ */