Some provisional bignum debugging has begun to detect inconsistent BIGNUM
[openssl.git] / crypto / bn / bn_nist.c
1 /* crypto/bn/bn_nist.p */
2 /* ====================================================================
3  * Copyright (c) 1998-2002 The OpenSSL Project.  All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions
7  * are met:
8  *
9  * 1. Redistributions of source code must retain the above copyright
10  *    notice, this list of conditions and the following disclaimer. 
11  *
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in
14  *    the documentation and/or other materials provided with the
15  *    distribution.
16  *
17  * 3. All advertising materials mentioning features or use of this
18  *    software must display the following acknowledgment:
19  *    "This product includes software developed by the OpenSSL Project
20  *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
21  *
22  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
23  *    endorse or promote products derived from this software without
24  *    prior written permission. For written permission, please contact
25  *    openssl-core@openssl.org.
26  *
27  * 5. Products derived from this software may not be called "OpenSSL"
28  *    nor may "OpenSSL" appear in their names without prior written
29  *    permission of the OpenSSL Project.
30  *
31  * 6. Redistributions of any form whatsoever must retain the following
32  *    acknowledgment:
33  *    "This product includes software developed by the OpenSSL Project
34  *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
35  *
36  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
37  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
38  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
39  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
40  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
41  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
42  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
43  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
44  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
45  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
46  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
47  * OF THE POSSIBILITY OF SUCH DAMAGE.
48  * ====================================================================
49  *
50  * This product includes cryptographic software written by Eric Young
51  * (eay@cryptsoft.com).  This product includes software written by Tim
52  * Hudson (tjh@cryptsoft.com).
53  *
54  */
55
56 #include "bn_lcl.h"
57 #include "cryptlib.h"
58
59 #define BN_NIST_192_TOP (192+BN_BITS2-1)/BN_BITS2
60 #define BN_NIST_224_TOP (224+BN_BITS2-1)/BN_BITS2
61 #define BN_NIST_256_TOP (256+BN_BITS2-1)/BN_BITS2
62 #define BN_NIST_384_TOP (384+BN_BITS2-1)/BN_BITS2
63 #define BN_NIST_521_TOP (521+BN_BITS2-1)/BN_BITS2
64
65 #if BN_BITS2 == 64
66 const static BN_ULONG _nist_p_192[] = {0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFE,
67         0xFFFFFFFFFFFFFFFF};
68 const static BN_ULONG _nist_p_224[] = {0x0000000000000001,0xFFFFFFFF00000000,
69         0xFFFFFFFFFFFFFFFF,0x00000000FFFFFFFF};
70 const static BN_ULONG _nist_p_256[] = {0xFFFFFFFFFFFFFFFF,0x00000000FFFFFFFF,
71         0x0000000000000000,0xFFFFFFFF00000001};
72 const static BN_ULONG _nist_p_384[] = {0x00000000FFFFFFFF,0xFFFFFFFF00000000,
73         0xFFFFFFFFFFFFFFFE,0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,
74         0xFFFFFFFFFFFFFFFF};
75 const static BN_ULONG _nist_p_521[] = {0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,
76         0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,
77         0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,
78         0x00000000000001FF};
79 #elif BN_BITS2 == 32
80 const static BN_ULONG _nist_p_192[] = {0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFE,
81         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF};
82 const static BN_ULONG _nist_p_224[] = {0x00000001,0x00000000,0x00000000,
83         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF};
84 const static BN_ULONG _nist_p_256[] = {0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
85         0x00000000,0x00000000,0x00000000,0x00000001,0xFFFFFFFF};
86 const static BN_ULONG _nist_p_384[] = {0xFFFFFFFF,0x00000000,0x00000000,
87         0xFFFFFFFF,0xFFFFFFFE,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
88         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF};
89 const static BN_ULONG _nist_p_521[] = {0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
90         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
91         0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,0xFFFFFFFF,
92         0xFFFFFFFF,0x000001FF};
93 #elif BN_BITS2 == 16
94 const static BN_ULONG _nist_p_192[] = {0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFE,
95         0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF};
96 const static BN_ULONG _nist_p_224[] = {0x0001,0x0000,0x0000,0x0000,0x0000,
97         0x0000,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF};
98 const static BN_ULONG _nist_p_256[] = {0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,
99         0xFFFF,0x0000,0x0000,0x0000,0x0000,0x0000,0x0000,0x0001,0x0000,0xFFFF,
100         0xFFFF};
101 const static BN_ULONG _nist_p_384[] = {0xFFFF,0xFFFF,0x0000,0x0000,0x0000,
102         0x0000,0xFFFF,0xFFFF,0xFFFE,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,
103         0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF};
104 const static BN_ULONG _nist_p_521[] = {0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,
105         0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,
106         0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,
107         0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0xFFFF,0x01FF};
108 #elif BN_BITS2 == 8
109 const static BN_ULONG _nist_p_192[] = {0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
110         0xFE,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
111         0xFF,0xFF};
112 const static BN_ULONG _nist_p_224[] = {0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
113         0x00,0x00,0x00,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
114         0xFF,0xFF,0xFF,0xFF,0xFF,0xFF};
115 const static BN_ULONG _nist_p_256[] = {0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
116         0xFF,0xFF,0xFF,0xFF,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
117         0x00,0x00,0x01,0x00,0x00,0x00,0xFF,0xFF,0xFF,0xFF};
118 const static BN_ULONG _nist_p_384[] = {0xFF,0xFF,0xFF,0xFF,0x00,0x00,0x00,0x00,
119         0x00,0x00,0x00,0x00,0xFF,0xFF,0xFF,0xFF,0xFE,0xFF,0xFF,0xFF,0xFF,0xFF,
120         0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
121         0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF};
122 const static BN_ULONG _nist_p_521[] = {0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
123         0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
124         0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
125         0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
126         0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
127         0xFF,0x01};
128 #endif
129
130 const BIGNUM *BN_get0_nist_prime_192(void)
131         {
132         static BIGNUM const_nist_192={(BN_ULONG *)_nist_p_192,BN_NIST_192_TOP,
133                 BN_NIST_192_TOP, 0, BN_FLG_STATIC_DATA};
134         return &const_nist_192;
135         }
136
137 const BIGNUM *BN_get0_nist_prime_224(void)
138         {
139         static BIGNUM const_nist_224={(BN_ULONG *)_nist_p_224,BN_NIST_224_TOP,
140                 BN_NIST_224_TOP, 0, BN_FLG_STATIC_DATA};
141         return &const_nist_224;
142         }
143
144 const BIGNUM *BN_get0_nist_prime_256(void)
145         {
146         static BIGNUM const_nist_256={(BN_ULONG *)_nist_p_256,BN_NIST_256_TOP,
147                 BN_NIST_256_TOP, 0, BN_FLG_STATIC_DATA};
148         return &const_nist_256;
149         }
150
151 const BIGNUM *BN_get0_nist_prime_384(void)
152         {
153         static BIGNUM const_nist_384={(BN_ULONG *)_nist_p_384,BN_NIST_384_TOP,
154                 BN_NIST_384_TOP, 0, BN_FLG_STATIC_DATA};
155         return &const_nist_384;
156         }
157
158 const BIGNUM *BN_get0_nist_prime_521(void)
159         {
160         static BIGNUM const_nist_521={(BN_ULONG *)_nist_p_521,BN_NIST_521_TOP,
161                 BN_NIST_521_TOP, 0, BN_FLG_STATIC_DATA};
162         return &const_nist_521;
163         }
164
165 /* some misc internal functions */
166 static BN_ULONG _256_data[BN_NIST_256_TOP*6];
167 static int _is_set_256_data = 0;
168 static void _init_256_data(void);
169
170 static BN_ULONG _384_data[BN_NIST_384_TOP*8];
171 static int _is_set_384_data = 0;
172 static void _init_384_data(void);
173
174 #define BN_NIST_ADD_ONE(a)      while (!(++(*(a)))) ++(a);
175 #define __buf_0                 (BN_ULONG)0
176 #define __buf_0_1               (BN_ULONG)0
177 #define __buf_0_2               (BN_ULONG)0
178 #if BN_BITS2 == 64
179 #define BN_64_BIT_BUF(n)        BN_ULONG __buf_##n = (BN_ULONG)0;
180 #define BN_CP_64_TO_BUF(n)      __buf_##n = (a)[(n)];
181 #define BN_CP_64_FROM_BUF(a,n)  *(a)++ = __buf_##n;
182 #define BN_CASE_64_BIT(n,a)     case (n): __buf_##n = (a)[(n)];
183 #if     UINT_MAX == 4294967295UL
184 #define nist32  unsigned int
185 #define BN_32_BIT_BUF(n)        nist32 __buf_##n = (nist32)0;
186 #define BN_CP_32_TO_BUF(n)      __buf_##n = ((nist32 *)(a))[(n)];
187 #define BN_CP_32_FROM_BUF(a,n)  *((nist32)(a))++ = __buf_##n;
188 #define BN_CASE_32_BIT(n,a)     case (n): __buf_##n = ((nist32)(a))[(n)];
189 #elif   ULONG_MAX == 4294967295UL
190 #define nist32  unsigned long
191 #define BN_32_BIT_BUF(n)        nist32 __buf_##n = (nist32)0;
192 #define BN_CP_32_TO_BUF(n)      __buf_##n = ((nist32 *)(a))[(n)];
193 #define BN_CP_32_FROM_BUF(a,n)  *((nist32)(a))++ = __buf_##n;
194 #define BN_CASE_32_BIT(n,a)     case (n): __buf_##n = ((nist32)(a))[(n)];
195 #else
196 #define NO_32_BIT_TYPE
197 #endif
198 #elif BN_BITS2 == 32
199 #define BN_64_BIT_BUF(n)        BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
200                                 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;
201 #define BN_CP_64_TO_BUF(n)      __buf_##n##_2 = (a)[2*(n)+1];\
202                                 __buf_##n##_1 = (a)[2*(n)];
203 #define BN_CP_64_FROM_BUF(a,n)  *(a)++ = __buf_##n##_1;\
204                                 *(a)++ = __buf_##n##_2;
205 #define BN_CASE_64_BIT(n,a)     case 2*(n)+1: __buf_##n##_2 = (a)[2*(n)+1];\
206                                 case 2*(n):   __buf_##n##_1 = (a)[2*(n)];
207                                 
208 #define BN_32_BIT_BUF(n)        BN_ULONG __buf_##n = (BN_ULONG)0;
209 #define BN_CP_32_TO_BUF(n)      __buf_##n = (a)[(n)];
210 #define BN_CP_32_FROM_BUF(a,n)  *(a)++ = __buf_##n;
211 #define BN_CASE_32_BIT(n,a)     case (n): __buf_##n = (a)[(n)];
212 #elif BN_BITS2 == 16
213 #define __buf_0_3               (BN_ULONG)0
214 #define __buf_0_4               (BN_ULONG)0
215 #define BN_64_BIT_BUF(n)        BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
216                                 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;\
217                                 BN_ULONG __buf_##n##_3 = (BN_ULONG)0;\
218                                 BN_ULONG __buf_##n##_4 = (BN_ULONG)0;
219 #define BN_CP_64_TO_BUF(n)      __buf_##n##_4 = (a)[4*(n)+3];\
220                                 __buf_##n##_3 = (a)[4*(n)+2];\
221                                 __buf_##n##_2 = (a)[4*(n)+1];\
222                                 __buf_##n##_1 = (a)[4*(n)];
223 #define BN_CP_64_FROM_BUF(a,n)  *(a)++ = __buf_##n##_1;\
224                                 *(a)++ = __buf_##n##_2;\
225                                 *(a)++ = __buf_##n##_3;\
226                                 *(a)++ = __buf_##n##_4;
227 #define BN_CASE_64_BIT(n,a)     case 4*(n)+3: __buf_##n##_4 = (a)[4*(n)+3];\
228                                 case 4*(n)+2: __buf_##n##_3 = (a)[4*(n)+2];\
229                                 case 4*(n)+1: __buf_##n##_2 = (a)[4*(n)+1];\
230                                 case 4*(n):   __buf_##n##_1 = (a)[4*(n)];
231 #define BN_32_BIT_BUF(n)        BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
232                                 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;
233 #define BN_CP_32_TO_BUF(n)      __buf_##n##_1 = (a)[2*(n)];\
234                                 __buf_##n##_2 = (a)[2*(n)+1];
235 #define BN_CP_32_FROM_BUF(a,n)  *(a)++ = __buf_##n##_1;\
236                                 *(a)++ = __buf_##n##_2;
237 #define BN_CASE_32_BIT(n,a)     case 2*(n)+1: __buf_##n##_2 = (a)[2*(n)+1];\
238                                 case 2*(n):   __buf_##n##_1 = (a)[2*(n)];
239 #elif BN_BITS2 == 8
240 #define __buf_0_3               (BN_ULONG)0
241 #define __buf_0_4               (BN_ULONG)0
242 #define __buf_0_5               (BN_ULONG)0
243 #define __buf_0_6               (BN_ULONG)0
244 #define __buf_0_7               (BN_ULONG)0
245 #define __buf_0_8               (BN_ULONG)0
246 #define BN_64_BIT_BUF(n)        BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
247                                 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;\
248                                 BN_ULONG __buf_##n##_3 = (BN_ULONG)0;\
249                                 BN_ULONG __buf_##n##_4 = (BN_ULONG)0;\
250                                 BN_ULONG __buf_##n##_5 = (BN_ULONG)0;\
251                                 BN_ULONG __buf_##n##_6 = (BN_ULONG)0;\
252                                 BN_ULONG __buf_##n##_7 = (BN_ULONG)0;\
253                                 BN_ULONG __buf_##n##_8 = (BN_ULONG)0;
254 #define BN_CP_64_TO_BUF(n)      __buf_##n##_8 = (a)[8*(n)+7];\
255                                 __buf_##n##_7 = (a)[8*(n)+6];\
256                                 __buf_##n##_6 = (a)[8*(n)+5];\
257                                 __buf_##n##_5 = (a)[8*(n)+4];\
258                                 __buf_##n##_4 = (a)[8*(n)+3];\
259                                 __buf_##n##_3 = (a)[8*(n)+2];\
260                                 __buf_##n##_2 = (a)[8*(n)+1];\
261                                 __buf_##n##_1 = (a)[8*(n)];
262 #define BN_CP_64_FROM_BUF(a,n)  *(a)++ = __buf_##n##_1;\
263                                 *(a)++ = __buf_##n##_2;\
264                                 *(a)++ = __buf_##n##_3;\
265                                 *(a)++ = __buf_##n##_4;\
266                                 *(a)++ = __buf_##n##_5;\
267                                 *(a)++ = __buf_##n##_6;\
268                                 *(a)++ = __buf_##n##_7;\
269                                 *(a)++ = __buf_##n##_8;
270 #define BN_CASE_64_BIT(n,a)     case 8*(n)+7: __buf_##n##_8 = (a)[8*(n)+7];\
271                                 case 8*(n)+6: __buf_##n##_7 = (a)[8*(n)+6];\
272                                 case 8*(n)+5: __buf_##n##_6 = (a)[8*(n)+5];\
273                                 case 8*(n)+4: __buf_##n##_5 = (a)[8*(n)+4];\
274                                 case 8*(n)+3: __buf_##n##_4 = (a)[8*(n)+3];\
275                                 case 8*(n)+2: __buf_##n##_3 = (a)[8*(n)+2];\
276                                 case 8*(n)+1: __buf_##n##_2 = (a)[8*(n)+1];\
277                                 case 8*(n):   __buf_##n##_1 = (a)[8*(n)];
278 #define BN_32_BIT_BUF(n)        BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
279                                 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;\
280                                 BN_ULONG __buf_##n##_3 = (BN_ULONG)0;\
281                                 BN_ULONG __buf_##n##_4 = (BN_ULONG)0;
282 #define BN_CP_32_TO_BUF(n)      __buf_##n##_1 = (a)[4*(n)];\
283                                 __buf_##n##_2 = (a)[4*(n)+1];\
284                                 __buf_##n##_3 = (a)[4*(n)+2];\
285                                 __buf_##n##_4 = (a)[4*(n)+3];
286 #define BN_CP_32_FROM_BUF(a,n)  *(a)++ = __buf_##n##_1;\
287                                 *(a)++ = __buf_##n##_2;\
288                                 *(a)++ = __buf_##n##_3;\
289                                 *(a)++ = __buf_##n##_4;
290 #define BN_CASE_32_BIT(n,a)     case 4*(n)+3: __buf_##n##_4 = (a)[4*(n)+3];\
291                                 case 4*(n)+2: __buf_##n##_3 = (a)[4*(n)+2];\
292                                 case 4*(n)+1: __buf_##n##_2 = (a)[4*(n)+1];\
293                                 case 4*(n):   __buf_##n##_1 = (a)[4*(n)];
294 #endif
295
296
297 #define BN_192_SET(d,a1,a2,a3) \
298         {\
299         register BN_ULONG *td = (d);\
300         BN_CP_64_FROM_BUF(td,a3); BN_CP_64_FROM_BUF(td,a2);\
301         BN_CP_64_FROM_BUF(td,a1);\
302         }
303
304 int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
305         BN_CTX *ctx)
306         {
307         int      top;
308         BN_ULONG carry = 0;
309         register BN_ULONG *r_d, *a_d;
310         BN_ULONG t_d[BN_NIST_192_TOP];
311         BN_64_BIT_BUF(3)  BN_64_BIT_BUF(4)
312         BN_64_BIT_BUF(5)
313
314         top = BN_ucmp(field, a);
315         if (top == 0)
316                 return BN_zero(r);
317         else if (top > 0)
318                 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
319
320         if (r != a)
321                 if (!BN_ncopy(r, a, BN_NIST_192_TOP))
322                         return 0;
323
324         r_d = r->d;
325         a_d = a->d;
326         top = a->top-1;
327
328         switch (top)
329                 {
330                 BN_CASE_64_BIT(5, a_d)
331                 BN_CASE_64_BIT(4, a_d)
332                 BN_CASE_64_BIT(3, a_d)
333                         break;
334                 default: /* a->top == field->top */
335                         return BN_usub(r, a, field);
336                 }
337
338         BN_192_SET(t_d,0,3,3)
339         if (bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP))
340                 ++carry;
341
342         BN_192_SET(t_d,4,4,0)
343         if (bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP))
344                 ++carry;
345
346         BN_192_SET(t_d,5,5,5)
347         if (bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP))
348                 ++carry;
349
350         while (carry)
351                 {
352                 if (bn_sub_words(r_d, r_d, _nist_p_192, BN_NIST_192_TOP))
353                         --carry; 
354                 }
355         r->top = BN_NIST_192_TOP;
356
357 #if 1
358         bn_clear_top2max(r);
359 #endif
360         bn_fix_top(r);
361
362         if (BN_ucmp(r, field) >= 0)
363                 {
364                 bn_sub_words(r_d, r_d, _nist_p_192, BN_NIST_192_TOP);
365                 bn_fix_top(r);
366                 }
367
368         return 1;
369         }
370
371 #define BN_224_SET(d,a1,a2,a3,a4,a5,a6,a7) \
372         {\
373         register BN_ULONG *td = (d);\
374         BN_CP_32_FROM_BUF(td,a7); BN_CP_32_FROM_BUF(td,a6);\
375         BN_CP_32_FROM_BUF(td,a5); BN_CP_32_FROM_BUF(td,a4);\
376         BN_CP_32_FROM_BUF(td,a3); BN_CP_32_FROM_BUF(td,a2);\
377         BN_CP_32_FROM_BUF(td,a1);\
378         }
379
380 int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
381         BN_CTX *ctx)
382         {
383 #ifndef NO_32_BIT_TYPE
384         int     tmp_int;
385         int     carry = 0;
386         BN_ULONG *r_d, *a_d;
387         BN_ULONG t_d[BN_NIST_224_TOP];
388         BN_32_BIT_BUF(7)  BN_32_BIT_BUF(8)
389         BN_32_BIT_BUF(9)  BN_32_BIT_BUF(10)
390         BN_32_BIT_BUF(11) BN_32_BIT_BUF(12)
391         BN_32_BIT_BUF(13)
392
393         tmp_int = BN_ucmp(field, a);
394         if (tmp_int == 0)
395                 return BN_zero(r);
396         else if (tmp_int > 0)
397                 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
398
399         if (r != a)
400                 if (!BN_ncopy(r, a, BN_NIST_224_TOP))
401                         return 0;
402
403         r_d = r->d;
404         a_d = a->d;
405
406         tmp_int = a->top-1;
407
408         switch (tmp_int)
409                 {
410                 BN_CASE_32_BIT(13, a_d)
411                 BN_CASE_32_BIT(12, a_d)
412                 BN_CASE_32_BIT(11, a_d)
413                 BN_CASE_32_BIT(10, a_d)
414                 BN_CASE_32_BIT(9,  a_d)
415                 BN_CASE_32_BIT(8,  a_d)
416                 BN_CASE_32_BIT(7,  a_d)
417                         break;
418                 default: /* a->top == field->top */
419                         return BN_usub(r, a, field);
420                 }
421
422         BN_224_SET(t_d,10,9,8,7,0,0,0)
423         if (bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP))
424                 ++carry;
425         BN_224_SET(t_d,0,13,12,11,0,0,0)
426         if (bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP))
427                 ++carry;
428         BN_224_SET(t_d,13,12,11,10,9,8,7)
429         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP))
430                 --carry;
431         BN_224_SET(t_d,0,0,0,0,13,12,11)
432         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP))
433                 --carry;
434
435         if (carry > 0)
436                 while (carry)
437                         {
438                         if (bn_sub_words(r_d,r_d,_nist_p_224,BN_NIST_224_TOP))
439                                 --carry;
440                         }
441         else if (carry < 0)
442                 while (carry)
443                         {
444                         if (bn_add_words(r_d,r_d,_nist_p_224,BN_NIST_224_TOP))
445                                 ++carry;
446                         }
447
448         r->top = BN_NIST_224_TOP;
449 #if 1
450         bn_clear_top2max(r);
451 #endif
452         bn_fix_top(r);
453
454         if (BN_ucmp(r, field) >= 0)
455                 {
456                 bn_sub_words(r_d, r_d, _nist_p_224, BN_NIST_224_TOP);
457                 bn_fix_top(r);
458                 }
459         return 1;
460 #else
461         return 0;
462 #endif
463         }
464
465 static void _init_256_data(void)
466         {
467         int     i;
468         BN_ULONG *tmp1 = _256_data;
469         const BN_ULONG *tmp2 = tmp1;
470
471         memcpy(tmp1, _nist_p_256, BN_NIST_256_TOP * sizeof(BN_ULONG));
472         tmp1 += BN_NIST_256_TOP;
473
474         for (i=0; i<5; i++)
475                 {
476                 bn_add_words(tmp1, _nist_p_256, tmp2, BN_NIST_256_TOP);
477                 tmp2  = tmp1;
478                 tmp1 += BN_NIST_256_TOP;
479                 }
480         _is_set_256_data = 1;
481         }
482
483 #define BN_256_SET(d,a1,a2,a3,a4,a5,a6,a7,a8) \
484         {\
485         register BN_ULONG *td = (d);\
486         BN_CP_32_FROM_BUF(td,a8); BN_CP_32_FROM_BUF(td,a7);\
487         BN_CP_32_FROM_BUF(td,a6); BN_CP_32_FROM_BUF(td,a5);\
488         BN_CP_32_FROM_BUF(td,a4); BN_CP_32_FROM_BUF(td,a3);\
489         BN_CP_32_FROM_BUF(td,a2); BN_CP_32_FROM_BUF(td,a1);\
490         }
491
492 int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
493         BN_CTX *ctx)
494         {
495 #ifndef NO_32_BIT_TYPE
496         int     tmp_int;
497         int     carry = 0;
498         register BN_ULONG *a_d, *r_d;
499         BN_ULONG t_d[BN_NIST_256_TOP];
500         BN_ULONG t_d2[BN_NIST_256_TOP];
501         BN_32_BIT_BUF(8)  BN_32_BIT_BUF(9)
502         BN_32_BIT_BUF(10) BN_32_BIT_BUF(11)
503         BN_32_BIT_BUF(12) BN_32_BIT_BUF(13)
504         BN_32_BIT_BUF(14) BN_32_BIT_BUF(15)
505
506         if (!_is_set_256_data)
507                 {
508                 CRYPTO_w_lock(CRYPTO_LOCK_BN);
509                 
510                 if (!_is_set_256_data)
511                         _init_256_data();
512                 
513                 CRYPTO_w_unlock(CRYPTO_LOCK_BN);
514                 }
515         
516         tmp_int = BN_ucmp(field, a);
517         if (tmp_int == 0)
518                 return BN_zero(r);
519         else if (tmp_int > 0)
520                 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
521
522         if (r != a)
523                 if (!BN_ncopy(r, a, BN_NIST_256_TOP))
524                         return 0;
525
526         tmp_int = a->top-1;
527
528         a_d = a->d;
529         r_d = r->d;
530         switch (tmp_int)
531                 {
532                 BN_CASE_32_BIT(15, a_d)
533                 BN_CASE_32_BIT(14, a_d)
534                 BN_CASE_32_BIT(13, a_d)
535                 BN_CASE_32_BIT(12, a_d)
536                 BN_CASE_32_BIT(11, a_d)
537                 BN_CASE_32_BIT(10, a_d)
538                 BN_CASE_32_BIT(9,  a_d)
539                 BN_CASE_32_BIT(8,  a_d)
540                         break;
541                 default: /* a->top == field->top */
542                         return BN_usub(r, a, field);
543                 }
544
545         /*S1*/
546         BN_256_SET(t_d,15,14,13,12,11,0,0,0)
547         /*S2*/
548         BN_256_SET(t_d2,0,15,14,13,12,0,0,0)
549         if (bn_add_words(t_d, t_d, t_d2, BN_NIST_256_TOP))
550                 carry = 2;
551         /* left shift */
552                 {
553                 register BN_ULONG *ap,t,c;
554                 ap = t_d;
555                 c=0;
556                 for (tmp_int=BN_NIST_256_TOP; tmp_int != 0; --tmp_int)
557                         {
558                         t= *ap;
559                         *(ap++)=((t<<1)|c)&BN_MASK2;
560                         c=(t & BN_TBIT)?1:0;
561                         }
562                 if (c)
563                         ++carry;
564                 }
565
566         if (bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP))
567                 ++carry;
568         /*S3*/
569         BN_256_SET(t_d,15,14,0,0,0,10,9,8)
570         if (bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP))
571                 ++carry;
572         /*S4*/
573         BN_256_SET(t_d,8,13,15,14,13,11,10,9)
574         if (bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP))
575                 ++carry;
576         /*D1*/
577         BN_256_SET(t_d,10,8,0,0,0,13,12,11)
578         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
579                 --carry;
580         /*D2*/
581         BN_256_SET(t_d,11,9,0,0,15,14,13,12)
582         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
583                 --carry;
584         /*D3*/
585         BN_256_SET(t_d,12,0,10,9,8,15,14,13)
586         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
587                 --carry;
588         /*D4*/
589         BN_256_SET(t_d,13,0,11,10,9,0,15,14)
590         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
591                 --carry;
592         
593         if (carry)
594                 {
595                 if (carry > 0)
596                         bn_sub_words(r_d, r_d, _256_data + BN_NIST_256_TOP *
597                                 --carry, BN_NIST_256_TOP);
598                 else
599                         {
600                         carry = -carry;
601                         bn_add_words(r_d, r_d, _256_data + BN_NIST_256_TOP *
602                                 --carry, BN_NIST_256_TOP);
603                         }
604                 }
605
606         r->top = BN_NIST_256_TOP;
607 #if 1
608         bn_clear_top2max(r);
609 #endif
610         bn_fix_top(r);
611
612         if (BN_ucmp(r, field) >= 0)
613                 {
614                 bn_sub_words(r_d, r_d, _nist_p_256, BN_NIST_256_TOP);
615                 bn_fix_top(r);
616                 }
617         return 1;
618 #else
619         return 0;
620 #endif
621         }
622
623 static void _init_384_data(void)
624         {
625         int     i;
626         BN_ULONG *tmp1 = _384_data;
627         const BN_ULONG *tmp2 = tmp1;
628
629         memcpy(tmp1, _nist_p_384, BN_NIST_384_TOP * sizeof(BN_ULONG));
630         tmp1 += BN_NIST_384_TOP;
631
632         for (i=0; i<7; i++)
633                 {
634                 bn_add_words(tmp1, _nist_p_384, tmp2, BN_NIST_384_TOP);
635                 tmp2  = tmp1;
636                 tmp1 += BN_NIST_384_TOP;
637                 }
638         _is_set_384_data = 1;
639         }
640
641 #define BN_384_SET(d,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12) \
642         {\
643         register BN_ULONG *td = (d);\
644         BN_CP_32_FROM_BUF(td,a12); BN_CP_32_FROM_BUF(td,a11);\
645         BN_CP_32_FROM_BUF(td,a10); BN_CP_32_FROM_BUF(td,a9);\
646         BN_CP_32_FROM_BUF(td,a8);  BN_CP_32_FROM_BUF(td,a7);\
647         BN_CP_32_FROM_BUF(td,a6);  BN_CP_32_FROM_BUF(td,a5);\
648         BN_CP_32_FROM_BUF(td,a4);  BN_CP_32_FROM_BUF(td,a3);\
649         BN_CP_32_FROM_BUF(td,a2);  BN_CP_32_FROM_BUF(td,a1);\
650         }
651
652 int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
653         BN_CTX *ctx)
654         {
655 #ifndef NO_32_BIT_TYPE
656         int     tmp_int;
657         int     carry = 0;
658         register BN_ULONG *r_d, *a_d;
659         BN_ULONG t_d[BN_NIST_384_TOP];
660         BN_32_BIT_BUF(12) BN_32_BIT_BUF(13)
661         BN_32_BIT_BUF(14) BN_32_BIT_BUF(15)
662         BN_32_BIT_BUF(16) BN_32_BIT_BUF(17)
663         BN_32_BIT_BUF(18) BN_32_BIT_BUF(19)
664         BN_32_BIT_BUF(20) BN_32_BIT_BUF(21)
665         BN_32_BIT_BUF(22) BN_32_BIT_BUF(23)
666
667         if (!_is_set_384_data)
668                 {
669                 CRYPTO_w_lock(CRYPTO_LOCK_BN);
670                 
671                 if (!_is_set_384_data)
672                         _init_384_data();
673
674                 CRYPTO_w_unlock(CRYPTO_LOCK_BN);
675                 }
676
677         tmp_int = BN_ucmp(field, a);
678         if (tmp_int == 0)
679                 return BN_zero(r);
680         else if (tmp_int > 0)
681                 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
682
683         if (r != a)
684                 if (!BN_ncopy(r, a, BN_NIST_384_TOP))
685                         return 0;
686
687         r_d = r->d;
688         a_d = a->d;
689         tmp_int = a->top-1;
690
691         switch (tmp_int)
692                 {
693                 BN_CASE_32_BIT(23, a_d)
694                 BN_CASE_32_BIT(22, a_d)
695                 BN_CASE_32_BIT(21, a_d)
696                 BN_CASE_32_BIT(20, a_d)
697                 BN_CASE_32_BIT(19, a_d)
698                 BN_CASE_32_BIT(18, a_d)
699                 BN_CASE_32_BIT(17, a_d)
700                 BN_CASE_32_BIT(16, a_d)
701                 BN_CASE_32_BIT(15, a_d)
702                 BN_CASE_32_BIT(14, a_d)
703                 BN_CASE_32_BIT(13, a_d)
704                 BN_CASE_32_BIT(12, a_d)
705                         break;
706                 default: /* a->top == field->top */
707                         return BN_usub(r, a, field);
708                 }
709
710         /*S1*/
711         BN_256_SET(t_d,0,0,0,0,0,23,22,21)
712                 /* left shift */
713                 {
714                 register BN_ULONG *ap,t,c;
715                 ap = t_d;
716                 c=0;
717                 for (tmp_int=BN_NIST_256_TOP; tmp_int != 0; --tmp_int)
718                         {
719                         t= *ap;
720                         *(ap++)=((t<<1)|c)&BN_MASK2;
721                         c=(t & BN_TBIT)?1:0;
722                         }
723                 }
724         if (bn_add_words(r_d+(128/BN_BITS2), r_d+(128/BN_BITS2), 
725                 t_d, BN_NIST_256_TOP))
726                 ++carry;
727         /*S2*/
728         BN_384_SET(t_d,23,22,21,20,19,18,17,16,15,14,13,12)
729         if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
730                 ++carry;
731         /*S3*/
732         BN_384_SET(t_d,20,19,18,17,16,15,14,13,12,23,22,21)
733         if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
734                 ++carry;
735         /*S4*/
736         BN_384_SET(t_d,19,18,17,16,15,14,13,12,20,0,23,0)
737         if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
738                 ++carry;
739         /*S5*/
740         BN_256_SET(t_d,0,0,0,0,23,22,21,20)
741         if (bn_add_words(r_d+(128/BN_BITS2), r_d+(128/BN_BITS2), 
742                 t_d, BN_NIST_256_TOP))
743                 ++carry;
744         /*S6*/
745         BN_384_SET(t_d,0,0,0,0,0,0,23,22,21,0,0,20)
746         if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
747                 ++carry;
748         /*D1*/
749         BN_384_SET(t_d,22,21,20,19,18,17,16,15,14,13,12,23)
750         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP))
751                 --carry;
752         /*D2*/
753         BN_384_SET(t_d,0,0,0,0,0,0,0,23,22,21,20,0)
754         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP))
755                 --carry;
756         /*D3*/
757         BN_384_SET(t_d,0,0,0,0,0,0,0,23,23,0,0,0)
758         if (bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP))
759                 --carry;
760         
761         if (carry)
762                 {
763                 if (carry > 0)
764                         bn_sub_words(r_d, r_d, _384_data + BN_NIST_384_TOP *
765                                 --carry, BN_NIST_384_TOP);
766                 else
767                         {
768                         carry = -carry;
769                         bn_add_words(r_d, r_d, _384_data + BN_NIST_384_TOP *
770                                 --carry, BN_NIST_384_TOP);
771                         }
772                 }
773
774         r->top = BN_NIST_384_TOP;
775 #if 1
776         bn_clear_top2max(r);
777 #endif
778         bn_fix_top(r);
779
780         if (BN_ucmp(r, field) >= 0)
781                 {
782                 bn_sub_words(r_d, r_d, _nist_p_384, BN_NIST_384_TOP);
783                 bn_fix_top(r);
784                 }
785         return 1;
786 #else
787         return 0;
788 #endif
789         }
790
791 int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
792         BN_CTX *ctx)
793         {
794 #if BN_BITS2 == 64
795 #define BN_NIST_521_TOP_MASK    (BN_ULONG)0x1FF
796 #elif BN_BITS2 == 32
797 #define BN_NIST_521_TOP_MASK    (BN_ULONG)0x1FF
798 #elif BN_BITS2 == 16
799 #define BN_NIST_521_TOP_MASK    (BN_ULONG)0x1FF
800 #elif BN_BITS2 == 8
801 #define BN_NIST_521_TOP_MASK    (BN_ULONG)0x1
802 #endif
803         int     top, ret = 0;
804         BN_ULONG *r_d;
805         BIGNUM  *tmp;
806
807         /* check whether a reduction is necessary */
808         top = a->top;
809         if (top < BN_NIST_521_TOP  || ( top == BN_NIST_521_TOP &&
810            (!(a->d[BN_NIST_521_TOP-1] & ~(BN_NIST_521_TOP_MASK)))))
811                 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
812
813         BN_CTX_start(ctx);
814         tmp = BN_CTX_get(ctx);
815         if (!tmp)
816                 goto err;
817
818         if (!BN_ncopy(tmp, a, BN_NIST_521_TOP))
819                 return 0;
820         if (!BN_rshift(r, a, 521))
821                 return 0;
822
823         if (tmp->top == BN_NIST_521_TOP)
824                 tmp->d[BN_NIST_521_TOP-1]  &= BN_NIST_521_TOP_MASK;
825
826         bn_fix_top(tmp);
827         if (!BN_uadd(r, tmp, r))
828                 return 0;
829         top = r->top;
830         r_d = r->d;
831         if (top == BN_NIST_521_TOP  && 
832            (r_d[BN_NIST_521_TOP-1] & ~(BN_NIST_521_TOP_MASK)))
833                 {
834                 BN_NIST_ADD_ONE(r_d)
835                 r_d[BN_NIST_521_TOP-1] &= BN_NIST_521_TOP_MASK; 
836                 }
837         bn_fix_top(r);
838
839         ret = 1;
840 err:
841         BN_CTX_end(ctx);
842
843         return ret;
844         }