source: asp3_tinet_ecnl_rx/trunk/wolfssl-3.12.2/wolfssl/wolfcrypt/integer.h@ 337

Last change on this file since 337 was 337, checked in by coas-nagasima, 6 years ago

ASP3版ECNLを追加

  • Property svn:eol-style set to native
  • Property svn:mime-type set to text/x-chdr;charset=UTF-8
File size: 12.8 KB
Line 
1/* integer.h
2 *
3 * Copyright (C) 2006-2017 wolfSSL Inc.
4 *
5 * This file is part of wolfSSL.
6 *
7 * wolfSSL is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * wolfSSL is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335, USA
20 */
21
22
23/*
24 * Based on public domain LibTomMath 0.38 by Tom St Denis, tomstdenis@iahu.ca,
25 * http://math.libtomcrypt.com
26 */
27
28
29#ifndef WOLF_CRYPT_INTEGER_H
30#define WOLF_CRYPT_INTEGER_H
31
32/* may optionally use fast math instead, not yet supported on all platforms and
33 may not be faster on all
34*/
35#include <wolfssl/wolfcrypt/types.h> /* will set MP_xxBIT if not default */
36#ifdef USE_FAST_MATH
37 #include <wolfssl/wolfcrypt/tfm.h>
38#else
39
40#include <wolfssl/wolfcrypt/random.h>
41
42#ifndef CHAR_BIT
43 #include <limits.h>
44#endif
45
46#include <wolfssl/wolfcrypt/mpi_class.h>
47
48/* wolf big int and common functions */
49#include <wolfssl/wolfcrypt/wolfmath.h>
50
51
52#ifdef WOLFSSL_PUBLIC_MP
53 #define MP_API WOLFSSL_API
54#else
55 #define MP_API
56#endif
57
58#ifndef MIN
59 #define MIN(x,y) ((x)<(y)?(x):(y))
60#endif
61
62#ifndef MAX
63 #define MAX(x,y) ((x)>(y)?(x):(y))
64#endif
65
66#ifdef __cplusplus
67extern "C" {
68
69/* C++ compilers don't like assigning void * to mp_digit * */
70#define OPT_CAST(x) (x *)
71
72#else
73
74/* C on the other hand doesn't care */
75#define OPT_CAST(x)
76
77#endif /* __cplusplus */
78
79
80/* detect 64-bit mode if possible */
81#if defined(__x86_64__)
82 #if !(defined(MP_64BIT) && defined(MP_16BIT) && defined(MP_8BIT))
83 #define MP_64BIT
84 #endif
85#endif
86/* if intel compiler doesn't provide 128 bit type don't turn on 64bit */
87#if defined(MP_64BIT) && defined(__INTEL_COMPILER) && !defined(HAVE___UINT128_T)
88 #undef MP_64BIT
89#endif
90
91
92/* allow user to define on mp_digit, mp_word, DIGIT_BIT types */
93#ifndef WOLFSSL_BIGINT_TYPES
94
95/* some default configurations.
96 *
97 * A "mp_digit" must be able to hold DIGIT_BIT + 1 bits
98 * A "mp_word" must be able to hold 2*DIGIT_BIT + 1 bits
99 *
100 * At the very least a mp_digit must be able to hold 7 bits
101 * [any size beyond that is ok provided it doesn't overflow the data type]
102 */
103#ifdef MP_8BIT
104 typedef unsigned char mp_digit;
105 typedef unsigned short mp_word;
106#elif defined(MP_16BIT) || defined(NO_64BIT)
107 typedef unsigned short mp_digit;
108 typedef unsigned int mp_word;
109 #define DIGIT_BIT 12
110#elif defined(MP_64BIT)
111 /* for GCC only on supported platforms */
112 typedef unsigned long long mp_digit; /* 64 bit type, 128 uses mode(TI) */
113 typedef unsigned long mp_word __attribute__ ((mode(TI)));
114
115 #define DIGIT_BIT 60
116#else
117 /* this is the default case, 28-bit digits */
118
119 #if defined(_MSC_VER) || defined(__BORLANDC__)
120 typedef unsigned __int64 ulong64;
121 #else
122 typedef unsigned long long ulong64;
123 #endif
124
125 typedef unsigned int mp_digit; /* long could be 64 now, changed TAO */
126 typedef ulong64 mp_word;
127
128#ifdef MP_31BIT
129 /* this is an extension that uses 31-bit digits */
130 #define DIGIT_BIT 31
131#else
132 /* default case is 28-bit digits, defines MP_28BIT as a handy test macro */
133 #define DIGIT_BIT 28
134 #define MP_28BIT
135#endif
136#endif
137
138#endif /* WOLFSSL_BIGINT_TYPES */
139
140/* otherwise the bits per digit is calculated automatically from the size of
141 a mp_digit */
142#ifndef DIGIT_BIT
143 #define DIGIT_BIT ((int)((CHAR_BIT * sizeof(mp_digit) - 1)))
144 /* bits per digit */
145#endif
146
147#define MP_DIGIT_BIT DIGIT_BIT
148#define MP_MASK ((((mp_digit)1)<<((mp_digit)DIGIT_BIT))-((mp_digit)1))
149#define MP_DIGIT_MAX MP_MASK
150
151/* equalities */
152#define MP_LT -1 /* less than */
153#define MP_EQ 0 /* equal to */
154#define MP_GT 1 /* greater than */
155
156#define MP_ZPOS 0 /* positive integer */
157#define MP_NEG 1 /* negative */
158
159#define MP_OKAY 0 /* ok result */
160#define MP_MEM -2 /* out of mem */
161#define MP_VAL -3 /* invalid input */
162#define MP_NOT_INF -4 /* point not at infinity */
163#define MP_RANGE MP_NOT_INF
164
165#define MP_YES 1 /* yes response */
166#define MP_NO 0 /* no response */
167
168/* Primality generation flags */
169#define LTM_PRIME_BBS 0x0001 /* BBS style prime */
170#define LTM_PRIME_SAFE 0x0002 /* Safe prime (p-1)/2 == prime */
171#define LTM_PRIME_2MSB_ON 0x0008 /* force 2nd MSB to 1 */
172
173typedef int mp_err;
174
175/* define this to use lower memory usage routines (exptmods mostly) */
176#define MP_LOW_MEM
177
178/* default precision */
179#ifndef MP_PREC
180 #ifndef MP_LOW_MEM
181 #define MP_PREC 32 /* default digits of precision */
182 #else
183 #define MP_PREC 1 /* default digits of precision */
184 #endif
185#endif
186
187/* size of comba arrays, should be at least 2 * 2**(BITS_PER_WORD -
188 BITS_PER_DIGIT*2) */
189#define MP_WARRAY (1 << (sizeof(mp_word) * CHAR_BIT - 2 * DIGIT_BIT + 1))
190
191#ifdef HAVE_WOLF_BIGINT
192 struct WC_BIGINT;
193#endif
194
195/* the mp_int structure */
196typedef struct mp_int {
197 int used, alloc, sign;
198 mp_digit *dp;
199
200#ifdef HAVE_WOLF_BIGINT
201 struct WC_BIGINT raw; /* unsigned binary (big endian) */
202#endif
203} mp_int;
204#define MP_INT_DEFINED
205
206/* callback for mp_prime_random, should fill dst with random bytes and return
207 how many read [up to len] */
208typedef int ltm_prime_callback(unsigned char *dst, int len, void *dat);
209
210
211#define USED(m) ((m)->used)
212#define DIGIT(m,k) ((m)->dp[(k)])
213#define SIGN(m) ((m)->sign)
214
215
216/* ---> Basic Manipulations <--- */
217#define mp_iszero(a) (((a)->used == 0) ? MP_YES : MP_NO)
218#define mp_isone(a) \
219 (((((a)->used == 1)) && ((a)->dp[0] == 1u)) ? MP_YES : MP_NO)
220#define mp_iseven(a) \
221 (((a)->used > 0 && (((a)->dp[0] & 1u) == 0u)) ? MP_YES : MP_NO)
222#define mp_isodd(a) \
223 (((a)->used > 0 && (((a)->dp[0] & 1u) == 1u)) ? MP_YES : MP_NO)
224#define mp_isneg(a) (((a)->sign != MP_ZPOS) ? MP_YES : MP_NO)
225
226/* number of primes */
227#ifdef MP_8BIT
228 #define PRIME_SIZE 31
229#else
230 #define PRIME_SIZE 256
231#endif
232
233#ifndef MAX_INVMOD_SZ
234 #if defined(WOLFSSL_MYSQL_COMPATIBLE)
235 #define MAX_INVMOD_SZ 8192
236 #else
237 #define MAX_INVMOD_SZ 4096
238 #endif
239#endif
240
241#define mp_prime_random(a, t, size, bbs, cb, dat) \
242 mp_prime_random_ex(a, t, ((size) * 8) + 1, (bbs==1)?LTM_PRIME_BBS:0, cb, dat)
243
244#define mp_read_raw(mp, str, len) mp_read_signed_bin((mp), (str), (len))
245#define mp_raw_size(mp) mp_signed_bin_size(mp)
246#define mp_toraw(mp, str) mp_to_signed_bin((mp), (str))
247#define mp_read_mag(mp, str, len) mp_read_unsigned_bin((mp), (str), (len))
248#define mp_mag_size(mp) mp_unsigned_bin_size(mp)
249#define mp_tomag(mp, str) mp_to_unsigned_bin((mp), (str))
250
251#define mp_tobinary(M, S) mp_toradix((M), (S), 2)
252#define mp_tooctal(M, S) mp_toradix((M), (S), 8)
253#define mp_todecimal(M, S) mp_toradix((M), (S), 10)
254#define mp_tohex(M, S) mp_toradix((M), (S), 16)
255
256#define s_mp_mul(a, b, c) s_mp_mul_digs(a, b, c, (a)->used + (b)->used + 1)
257
258extern const char *mp_s_rmap;
259
260/* 6 functions needed by Rsa */
261MP_API int mp_init (mp_int * a);
262MP_API void mp_clear (mp_int * a);
263MP_API void mp_free (mp_int * a);
264MP_API void mp_forcezero(mp_int * a);
265MP_API int mp_unsigned_bin_size(mp_int * a);
266MP_API int mp_read_unsigned_bin (mp_int * a, const unsigned char *b, int c);
267MP_API int mp_to_unsigned_bin_at_pos(int x, mp_int *t, unsigned char *b);
268MP_API int mp_to_unsigned_bin (mp_int * a, unsigned char *b);
269MP_API int mp_exptmod (mp_int * G, mp_int * X, mp_int * P, mp_int * Y);
270/* end functions needed by Rsa */
271
272/* functions added to support above needed, removed TOOM and KARATSUBA */
273MP_API int mp_count_bits (mp_int * a);
274MP_API int mp_leading_bit (mp_int * a);
275MP_API int mp_init_copy (mp_int * a, mp_int * b);
276MP_API int mp_copy (mp_int * a, mp_int * b);
277MP_API int mp_grow (mp_int * a, int size);
278MP_API int mp_div_2d (mp_int * a, int b, mp_int * c, mp_int * d);
279MP_API void mp_zero (mp_int * a);
280MP_API void mp_clamp (mp_int * a);
281MP_API void mp_exch (mp_int * a, mp_int * b);
282MP_API void mp_rshd (mp_int * a, int b);
283MP_API void mp_rshb (mp_int * a, int b);
284MP_API int mp_mod_2d (mp_int * a, int b, mp_int * c);
285MP_API int mp_mul_2d (mp_int * a, int b, mp_int * c);
286MP_API int mp_lshd (mp_int * a, int b);
287MP_API int mp_abs (mp_int * a, mp_int * b);
288MP_API int mp_invmod (mp_int * a, mp_int * b, mp_int * c);
289int fast_mp_invmod (mp_int * a, mp_int * b, mp_int * c);
290MP_API int mp_invmod_slow (mp_int * a, mp_int * b, mp_int * c);
291MP_API int mp_cmp_mag (mp_int * a, mp_int * b);
292MP_API int mp_cmp (mp_int * a, mp_int * b);
293MP_API int mp_cmp_d(mp_int * a, mp_digit b);
294MP_API int mp_set (mp_int * a, mp_digit b);
295MP_API int mp_is_bit_set (mp_int * a, mp_digit b);
296MP_API int mp_mod (mp_int * a, mp_int * b, mp_int * c);
297MP_API int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d);
298MP_API int mp_div_2(mp_int * a, mp_int * b);
299MP_API int mp_add (mp_int * a, mp_int * b, mp_int * c);
300int s_mp_add (mp_int * a, mp_int * b, mp_int * c);
301int s_mp_sub (mp_int * a, mp_int * b, mp_int * c);
302MP_API int mp_sub (mp_int * a, mp_int * b, mp_int * c);
303MP_API int mp_reduce_is_2k_l(mp_int *a);
304MP_API int mp_reduce_is_2k(mp_int *a);
305MP_API int mp_dr_is_modulus(mp_int *a);
306MP_API int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y,
307 int);
308MP_API int mp_montgomery_setup (mp_int * n, mp_digit * rho);
309int fast_mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho);
310MP_API int mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho);
311MP_API void mp_dr_setup(mp_int *a, mp_digit *d);
312MP_API int mp_dr_reduce (mp_int * x, mp_int * n, mp_digit k);
313MP_API int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d);
314int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
315int s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
316MP_API int mp_reduce_2k_setup_l(mp_int *a, mp_int *d);
317MP_API int mp_reduce_2k_l(mp_int *a, mp_int *n, mp_int *d);
318MP_API int mp_reduce (mp_int * x, mp_int * m, mp_int * mu);
319MP_API int mp_reduce_setup (mp_int * a, mp_int * b);
320int s_mp_exptmod (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode);
321MP_API int mp_montgomery_calc_normalization (mp_int * a, mp_int * b);
322int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
323int s_mp_sqr (mp_int * a, mp_int * b);
324int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs);
325int fast_s_mp_sqr (mp_int * a, mp_int * b);
326MP_API int mp_init_size (mp_int * a, int size);
327MP_API int mp_div_3 (mp_int * a, mp_int *c, mp_digit * d);
328MP_API int mp_mul_2(mp_int * a, mp_int * b);
329MP_API int mp_mul (mp_int * a, mp_int * b, mp_int * c);
330MP_API int mp_sqr (mp_int * a, mp_int * b);
331MP_API int mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d);
332MP_API int mp_submod (mp_int* a, mp_int* b, mp_int* c, mp_int* d);
333MP_API int mp_addmod (mp_int* a, mp_int* b, mp_int* c, mp_int* d);
334MP_API int mp_mul_d (mp_int * a, mp_digit b, mp_int * c);
335MP_API int mp_2expt (mp_int * a, int b);
336MP_API int mp_set_bit (mp_int * a, int b);
337MP_API int mp_reduce_2k_setup(mp_int *a, mp_digit *d);
338MP_API int mp_add_d (mp_int* a, mp_digit b, mp_int* c);
339MP_API int mp_set_int (mp_int * a, unsigned long b);
340MP_API int mp_sub_d (mp_int * a, mp_digit b, mp_int * c);
341/* end support added functions */
342
343/* added */
344MP_API int mp_init_multi(mp_int* a, mp_int* b, mp_int* c, mp_int* d, mp_int* e,
345 mp_int* f);
346MP_API int mp_toradix (mp_int *a, char *str, int radix);
347MP_API int mp_radix_size (mp_int * a, int radix, int *size);
348
349#ifdef WOLFSSL_DEBUG_MATH
350 MP_API void mp_dump(const char* desc, mp_int* a, byte verbose);
351#else
352 #define mp_dump(desc, a, verbose)
353#endif
354
355#if defined(HAVE_ECC) || defined(WOLFSSL_KEY_GEN)
356 MP_API int mp_sqrmod(mp_int* a, mp_int* b, mp_int* c);
357#endif
358#if defined(HAVE_ECC) || defined(WOLFSSL_KEY_GEN)
359 MP_API int mp_read_radix(mp_int* a, const char* str, int radix);
360#endif
361
362#ifdef WOLFSSL_KEY_GEN
363 MP_API int mp_prime_is_prime (mp_int * a, int t, int *result);
364 MP_API int mp_gcd (mp_int * a, mp_int * b, mp_int * c);
365 MP_API int mp_lcm (mp_int * a, mp_int * b, mp_int * c);
366 MP_API int mp_rand_prime(mp_int* N, int len, WC_RNG* rng, void* heap);
367#endif
368
369MP_API int mp_cnt_lsb(mp_int *a);
370MP_API int mp_mod_d(mp_int* a, mp_digit b, mp_digit* c);
371
372
373/* wolf big int and common functions */
374#include <wolfssl/wolfcrypt/wolfmath.h>
375
376
377#ifdef __cplusplus
378 }
379#endif
380
381
382#endif /* USE_FAST_MATH */
383
384#endif /* WOLF_CRYPT_INTEGER_H */
385
Note: See TracBrowser for help on using the repository browser.