1 /* crypto/bn/bn_nist.p */
2 /* ====================================================================
3 * Copyright (c) 1998-2002 The OpenSSL Project. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
31 * 6. Redistributions of any form whatsoever must retain the following
33 * "This product includes software developed by the OpenSSL Project
34 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
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 * ====================================================================
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).
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
66 const static BN_ULONG _nist_p_192[] = {0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFE,
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,
75 const static BN_ULONG _nist_p_521[] = {0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,
76 0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,
77 0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,0xFFFFFFFFFFFFFFFF,
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};
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,
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};
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,
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,
130 static const BIGNUM_C bn_nist_p_192 =
131 { _nist_p_192, BN_NIST_192_TOP, BN_NIST_192_TOP, 0, BN_FLG_STATIC_DATA };
132 static const BIGNUM_C bn_nist_p_224 =
133 { _nist_p_224, BN_NIST_224_TOP, BN_NIST_224_TOP, 0, BN_FLG_STATIC_DATA };
134 static const BIGNUM_C bn_nist_p_256 =
135 { _nist_p_256, BN_NIST_256_TOP, BN_NIST_256_TOP, 0, BN_FLG_STATIC_DATA };
136 static const BIGNUM_C bn_nist_p_384 =
137 { _nist_p_384, BN_NIST_384_TOP, BN_NIST_384_TOP, 0, BN_FLG_STATIC_DATA };
138 static const BIGNUM_C bn_nist_p_521 =
139 { _nist_p_521, BN_NIST_521_TOP, BN_NIST_521_TOP, 0, BN_FLG_STATIC_DATA };
141 const BIGNUM *BN_get0_nist_prime_192(void)
143 return BIGNUM_CONST(&bn_nist_p_192);
146 const BIGNUM *BN_get0_nist_prime_224(void)
148 return BIGNUM_CONST(&bn_nist_p_224);
151 const BIGNUM *BN_get0_nist_prime_256(void)
153 return BIGNUM_CONST(&bn_nist_p_256);
156 const BIGNUM *BN_get0_nist_prime_384(void)
158 return BIGNUM_CONST(&bn_nist_p_384);
161 const BIGNUM *BN_get0_nist_prime_521(void)
163 return BIGNUM_CONST(&bn_nist_p_521);
166 /* some misc internal functions */
167 static BN_ULONG _256_data[BN_NIST_256_TOP*6];
168 static int _is_set_256_data = 0;
169 static void _init_256_data(void);
171 static BN_ULONG _384_data[BN_NIST_384_TOP*8];
172 static int _is_set_384_data = 0;
173 static void _init_384_data(void);
175 #define BN_NIST_ADD_ONE(a) while (!(++(*(a)))) ++(a);
176 #define __buf_0 (BN_ULONG)0
177 #define __buf_0_1 (BN_ULONG)0
178 #define __buf_0_2 (BN_ULONG)0
180 #define BN_64_BIT_BUF(n) BN_ULONG __buf_##n = (BN_ULONG)0;
181 #define BN_CP_64_TO_BUF(n) __buf_##n = (a)[(n)];
182 #define BN_CP_64_FROM_BUF(a,n) *(a)++ = __buf_##n;
183 #define BN_CASE_64_BIT(n,a) case (n): __buf_##n = (a)[(n)];
184 #if UINT_MAX == 4294967295UL
185 #define nist32 unsigned int
186 #define BN_32_BIT_BUF(n) nist32 __buf_##n = (nist32)0;
187 #define BN_CP_32_TO_BUF(n) __buf_##n = ((nist32 *)(a))[(n)];
188 #define BN_CP_32_FROM_BUF(a,n) *((nist32)(a))++ = __buf_##n;
189 #define BN_CASE_32_BIT(n,a) case (n): __buf_##n = ((nist32)(a))[(n)];
190 #elif ULONG_MAX == 4294967295UL
191 #define nist32 unsigned long
192 #define BN_32_BIT_BUF(n) nist32 __buf_##n = (nist32)0;
193 #define BN_CP_32_TO_BUF(n) __buf_##n = ((nist32 *)(a))[(n)];
194 #define BN_CP_32_FROM_BUF(a,n) *((nist32)(a))++ = __buf_##n;
195 #define BN_CASE_32_BIT(n,a) case (n): __buf_##n = ((nist32)(a))[(n)];
197 #define NO_32_BIT_TYPE
200 #define BN_64_BIT_BUF(n) BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
201 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;
202 #define BN_CP_64_TO_BUF(n) __buf_##n##_2 = (a)[2*(n)+1];\
203 __buf_##n##_1 = (a)[2*(n)];
204 #define BN_CP_64_FROM_BUF(a,n) *(a)++ = __buf_##n##_1;\
205 *(a)++ = __buf_##n##_2;
206 #define BN_CASE_64_BIT(n,a) case 2*(n)+1: __buf_##n##_2 = (a)[2*(n)+1];\
207 case 2*(n): __buf_##n##_1 = (a)[2*(n)];
209 #define BN_32_BIT_BUF(n) BN_ULONG __buf_##n = (BN_ULONG)0;
210 #define BN_CP_32_TO_BUF(n) __buf_##n = (a)[(n)];
211 #define BN_CP_32_FROM_BUF(a,n) *(a)++ = __buf_##n;
212 #define BN_CASE_32_BIT(n,a) case (n): __buf_##n = (a)[(n)];
214 #define __buf_0_3 (BN_ULONG)0
215 #define __buf_0_4 (BN_ULONG)0
216 #define BN_64_BIT_BUF(n) BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
217 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;\
218 BN_ULONG __buf_##n##_3 = (BN_ULONG)0;\
219 BN_ULONG __buf_##n##_4 = (BN_ULONG)0;
220 #define BN_CP_64_TO_BUF(n) __buf_##n##_4 = (a)[4*(n)+3];\
221 __buf_##n##_3 = (a)[4*(n)+2];\
222 __buf_##n##_2 = (a)[4*(n)+1];\
223 __buf_##n##_1 = (a)[4*(n)];
224 #define BN_CP_64_FROM_BUF(a,n) *(a)++ = __buf_##n##_1;\
225 *(a)++ = __buf_##n##_2;\
226 *(a)++ = __buf_##n##_3;\
227 *(a)++ = __buf_##n##_4;
228 #define BN_CASE_64_BIT(n,a) case 4*(n)+3: __buf_##n##_4 = (a)[4*(n)+3];\
229 case 4*(n)+2: __buf_##n##_3 = (a)[4*(n)+2];\
230 case 4*(n)+1: __buf_##n##_2 = (a)[4*(n)+1];\
231 case 4*(n): __buf_##n##_1 = (a)[4*(n)];
232 #define BN_32_BIT_BUF(n) BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
233 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;
234 #define BN_CP_32_TO_BUF(n) __buf_##n##_1 = (a)[2*(n)];\
235 __buf_##n##_2 = (a)[2*(n)+1];
236 #define BN_CP_32_FROM_BUF(a,n) *(a)++ = __buf_##n##_1;\
237 *(a)++ = __buf_##n##_2;
238 #define BN_CASE_32_BIT(n,a) case 2*(n)+1: __buf_##n##_2 = (a)[2*(n)+1];\
239 case 2*(n): __buf_##n##_1 = (a)[2*(n)];
241 #define __buf_0_3 (BN_ULONG)0
242 #define __buf_0_4 (BN_ULONG)0
243 #define __buf_0_5 (BN_ULONG)0
244 #define __buf_0_6 (BN_ULONG)0
245 #define __buf_0_7 (BN_ULONG)0
246 #define __buf_0_8 (BN_ULONG)0
247 #define BN_64_BIT_BUF(n) BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
248 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;\
249 BN_ULONG __buf_##n##_3 = (BN_ULONG)0;\
250 BN_ULONG __buf_##n##_4 = (BN_ULONG)0;\
251 BN_ULONG __buf_##n##_5 = (BN_ULONG)0;\
252 BN_ULONG __buf_##n##_6 = (BN_ULONG)0;\
253 BN_ULONG __buf_##n##_7 = (BN_ULONG)0;\
254 BN_ULONG __buf_##n##_8 = (BN_ULONG)0;
255 #define BN_CP_64_TO_BUF(n) __buf_##n##_8 = (a)[8*(n)+7];\
256 __buf_##n##_7 = (a)[8*(n)+6];\
257 __buf_##n##_6 = (a)[8*(n)+5];\
258 __buf_##n##_5 = (a)[8*(n)+4];\
259 __buf_##n##_4 = (a)[8*(n)+3];\
260 __buf_##n##_3 = (a)[8*(n)+2];\
261 __buf_##n##_2 = (a)[8*(n)+1];\
262 __buf_##n##_1 = (a)[8*(n)];
263 #define BN_CP_64_FROM_BUF(a,n) *(a)++ = __buf_##n##_1;\
264 *(a)++ = __buf_##n##_2;\
265 *(a)++ = __buf_##n##_3;\
266 *(a)++ = __buf_##n##_4;\
267 *(a)++ = __buf_##n##_5;\
268 *(a)++ = __buf_##n##_6;\
269 *(a)++ = __buf_##n##_7;\
270 *(a)++ = __buf_##n##_8;
271 #define BN_CASE_64_BIT(n,a) case 8*(n)+7: __buf_##n##_8 = (a)[8*(n)+7];\
272 case 8*(n)+6: __buf_##n##_7 = (a)[8*(n)+6];\
273 case 8*(n)+5: __buf_##n##_6 = (a)[8*(n)+5];\
274 case 8*(n)+4: __buf_##n##_5 = (a)[8*(n)+4];\
275 case 8*(n)+3: __buf_##n##_4 = (a)[8*(n)+3];\
276 case 8*(n)+2: __buf_##n##_3 = (a)[8*(n)+2];\
277 case 8*(n)+1: __buf_##n##_2 = (a)[8*(n)+1];\
278 case 8*(n): __buf_##n##_1 = (a)[8*(n)];
279 #define BN_32_BIT_BUF(n) BN_ULONG __buf_##n##_1 = (BN_ULONG)0;\
280 BN_ULONG __buf_##n##_2 = (BN_ULONG)0;\
281 BN_ULONG __buf_##n##_3 = (BN_ULONG)0;\
282 BN_ULONG __buf_##n##_4 = (BN_ULONG)0;
283 #define BN_CP_32_TO_BUF(n) __buf_##n##_1 = (a)[4*(n)];\
284 __buf_##n##_2 = (a)[4*(n)+1];\
285 __buf_##n##_3 = (a)[4*(n)+2];\
286 __buf_##n##_4 = (a)[4*(n)+3];
287 #define BN_CP_32_FROM_BUF(a,n) *(a)++ = __buf_##n##_1;\
288 *(a)++ = __buf_##n##_2;\
289 *(a)++ = __buf_##n##_3;\
290 *(a)++ = __buf_##n##_4;
291 #define BN_CASE_32_BIT(n,a) case 4*(n)+3: __buf_##n##_4 = (a)[4*(n)+3];\
292 case 4*(n)+2: __buf_##n##_3 = (a)[4*(n)+2];\
293 case 4*(n)+1: __buf_##n##_2 = (a)[4*(n)+1];\
294 case 4*(n): __buf_##n##_1 = (a)[4*(n)];
298 #define BN_192_SET(d,a1,a2,a3) \
300 register BN_ULONG *td = (d);\
301 BN_CP_64_FROM_BUF(td,a3); BN_CP_64_FROM_BUF(td,a2);\
302 BN_CP_64_FROM_BUF(td,a1);\
305 int BN_nist_mod_192(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
310 register BN_ULONG *r_d, *a_d;
311 BN_ULONG t_d[BN_NIST_192_TOP];
312 BN_64_BIT_BUF(3) BN_64_BIT_BUF(4)
315 top = BN_ucmp(field, a);
319 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
322 if (!BN_ncopy(r, a, BN_NIST_192_TOP))
331 BN_CASE_64_BIT(5, a_d)
332 BN_CASE_64_BIT(4, a_d)
333 BN_CASE_64_BIT(3, a_d)
335 default: /* a->top == field->top */
336 return BN_usub(r, a, field);
339 BN_192_SET(t_d,0,3,3)
340 if (bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP))
343 BN_192_SET(t_d,4,4,0)
344 if (bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP))
347 BN_192_SET(t_d,5,5,5)
348 if (bn_add_words(r_d, r_d, t_d, BN_NIST_192_TOP))
353 if (bn_sub_words(r_d, r_d, _nist_p_192, BN_NIST_192_TOP))
356 r->top = BN_NIST_192_TOP;
363 if (BN_ucmp(r, field) >= 0)
365 bn_sub_words(r_d, r_d, _nist_p_192, BN_NIST_192_TOP);
372 #define BN_224_SET(d,a1,a2,a3,a4,a5,a6,a7) \
374 register BN_ULONG *td = (d);\
375 BN_CP_32_FROM_BUF(td,a7); BN_CP_32_FROM_BUF(td,a6);\
376 BN_CP_32_FROM_BUF(td,a5); BN_CP_32_FROM_BUF(td,a4);\
377 BN_CP_32_FROM_BUF(td,a3); BN_CP_32_FROM_BUF(td,a2);\
378 BN_CP_32_FROM_BUF(td,a1);\
381 int BN_nist_mod_224(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
384 #ifndef NO_32_BIT_TYPE
388 BN_ULONG t_d[BN_NIST_224_TOP];
389 BN_32_BIT_BUF(7) BN_32_BIT_BUF(8)
390 BN_32_BIT_BUF(9) BN_32_BIT_BUF(10)
391 BN_32_BIT_BUF(11) BN_32_BIT_BUF(12)
394 tmp_int = BN_ucmp(field, a);
397 else if (tmp_int > 0)
398 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
401 if (!BN_ncopy(r, a, BN_NIST_224_TOP))
411 BN_CASE_32_BIT(13, a_d)
412 BN_CASE_32_BIT(12, a_d)
413 BN_CASE_32_BIT(11, a_d)
414 BN_CASE_32_BIT(10, a_d)
415 BN_CASE_32_BIT(9, a_d)
416 BN_CASE_32_BIT(8, a_d)
417 BN_CASE_32_BIT(7, a_d)
419 default: /* a->top == field->top */
420 return BN_usub(r, a, field);
423 BN_224_SET(t_d,10,9,8,7,0,0,0)
424 if (bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP))
426 BN_224_SET(t_d,0,13,12,11,0,0,0)
427 if (bn_add_words(r_d, r_d, t_d, BN_NIST_224_TOP))
429 BN_224_SET(t_d,13,12,11,10,9,8,7)
430 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP))
432 BN_224_SET(t_d,0,0,0,0,13,12,11)
433 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_224_TOP))
439 if (bn_sub_words(r_d,r_d,_nist_p_224,BN_NIST_224_TOP))
445 if (bn_add_words(r_d,r_d,_nist_p_224,BN_NIST_224_TOP))
449 r->top = BN_NIST_224_TOP;
455 if (BN_ucmp(r, field) >= 0)
457 bn_sub_words(r_d, r_d, _nist_p_224, BN_NIST_224_TOP);
466 static void _init_256_data(void)
469 BN_ULONG *tmp1 = _256_data;
470 const BN_ULONG *tmp2 = tmp1;
472 memcpy(tmp1, _nist_p_256, BN_NIST_256_TOP * sizeof(BN_ULONG));
473 tmp1 += BN_NIST_256_TOP;
477 bn_add_words(tmp1, _nist_p_256, tmp2, BN_NIST_256_TOP);
479 tmp1 += BN_NIST_256_TOP;
481 _is_set_256_data = 1;
484 #define BN_256_SET(d,a1,a2,a3,a4,a5,a6,a7,a8) \
486 register BN_ULONG *td = (d);\
487 BN_CP_32_FROM_BUF(td,a8); BN_CP_32_FROM_BUF(td,a7);\
488 BN_CP_32_FROM_BUF(td,a6); BN_CP_32_FROM_BUF(td,a5);\
489 BN_CP_32_FROM_BUF(td,a4); BN_CP_32_FROM_BUF(td,a3);\
490 BN_CP_32_FROM_BUF(td,a2); BN_CP_32_FROM_BUF(td,a1);\
493 int BN_nist_mod_256(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
496 #ifndef NO_32_BIT_TYPE
499 register BN_ULONG *a_d, *r_d;
500 BN_ULONG t_d[BN_NIST_256_TOP];
501 BN_ULONG t_d2[BN_NIST_256_TOP];
502 BN_32_BIT_BUF(8) BN_32_BIT_BUF(9)
503 BN_32_BIT_BUF(10) BN_32_BIT_BUF(11)
504 BN_32_BIT_BUF(12) BN_32_BIT_BUF(13)
505 BN_32_BIT_BUF(14) BN_32_BIT_BUF(15)
507 if (!_is_set_256_data)
509 CRYPTO_w_lock(CRYPTO_LOCK_BN);
511 if (!_is_set_256_data)
514 CRYPTO_w_unlock(CRYPTO_LOCK_BN);
517 tmp_int = BN_ucmp(field, a);
520 else if (tmp_int > 0)
521 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
524 if (!BN_ncopy(r, a, BN_NIST_256_TOP))
533 BN_CASE_32_BIT(15, a_d)
534 BN_CASE_32_BIT(14, a_d)
535 BN_CASE_32_BIT(13, a_d)
536 BN_CASE_32_BIT(12, a_d)
537 BN_CASE_32_BIT(11, a_d)
538 BN_CASE_32_BIT(10, a_d)
539 BN_CASE_32_BIT(9, a_d)
540 BN_CASE_32_BIT(8, a_d)
542 default: /* a->top == field->top */
543 return BN_usub(r, a, field);
547 BN_256_SET(t_d,15,14,13,12,11,0,0,0)
549 BN_256_SET(t_d2,0,15,14,13,12,0,0,0)
550 if (bn_add_words(t_d, t_d, t_d2, BN_NIST_256_TOP))
554 register BN_ULONG *ap,t,c;
557 for (tmp_int=BN_NIST_256_TOP; tmp_int != 0; --tmp_int)
560 *(ap++)=((t<<1)|c)&BN_MASK2;
567 if (bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP))
570 BN_256_SET(t_d,15,14,0,0,0,10,9,8)
571 if (bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP))
574 BN_256_SET(t_d,8,13,15,14,13,11,10,9)
575 if (bn_add_words(r_d, r_d, t_d, BN_NIST_256_TOP))
578 BN_256_SET(t_d,10,8,0,0,0,13,12,11)
579 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
582 BN_256_SET(t_d,11,9,0,0,15,14,13,12)
583 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
586 BN_256_SET(t_d,12,0,10,9,8,15,14,13)
587 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
590 BN_256_SET(t_d,13,0,11,10,9,0,15,14)
591 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_256_TOP))
597 bn_sub_words(r_d, r_d, _256_data + BN_NIST_256_TOP *
598 --carry, BN_NIST_256_TOP);
602 bn_add_words(r_d, r_d, _256_data + BN_NIST_256_TOP *
603 --carry, BN_NIST_256_TOP);
607 r->top = BN_NIST_256_TOP;
613 if (BN_ucmp(r, field) >= 0)
615 bn_sub_words(r_d, r_d, _nist_p_256, BN_NIST_256_TOP);
624 static void _init_384_data(void)
627 BN_ULONG *tmp1 = _384_data;
628 const BN_ULONG *tmp2 = tmp1;
630 memcpy(tmp1, _nist_p_384, BN_NIST_384_TOP * sizeof(BN_ULONG));
631 tmp1 += BN_NIST_384_TOP;
635 bn_add_words(tmp1, _nist_p_384, tmp2, BN_NIST_384_TOP);
637 tmp1 += BN_NIST_384_TOP;
639 _is_set_384_data = 1;
642 #define BN_384_SET(d,a1,a2,a3,a4,a5,a6,a7,a8,a9,a10,a11,a12) \
644 register BN_ULONG *td = (d);\
645 BN_CP_32_FROM_BUF(td,a12); BN_CP_32_FROM_BUF(td,a11);\
646 BN_CP_32_FROM_BUF(td,a10); BN_CP_32_FROM_BUF(td,a9);\
647 BN_CP_32_FROM_BUF(td,a8); BN_CP_32_FROM_BUF(td,a7);\
648 BN_CP_32_FROM_BUF(td,a6); BN_CP_32_FROM_BUF(td,a5);\
649 BN_CP_32_FROM_BUF(td,a4); BN_CP_32_FROM_BUF(td,a3);\
650 BN_CP_32_FROM_BUF(td,a2); BN_CP_32_FROM_BUF(td,a1);\
653 int BN_nist_mod_384(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
656 #ifndef NO_32_BIT_TYPE
659 register BN_ULONG *r_d, *a_d;
660 BN_ULONG t_d[BN_NIST_384_TOP];
661 BN_32_BIT_BUF(12) BN_32_BIT_BUF(13)
662 BN_32_BIT_BUF(14) BN_32_BIT_BUF(15)
663 BN_32_BIT_BUF(16) BN_32_BIT_BUF(17)
664 BN_32_BIT_BUF(18) BN_32_BIT_BUF(19)
665 BN_32_BIT_BUF(20) BN_32_BIT_BUF(21)
666 BN_32_BIT_BUF(22) BN_32_BIT_BUF(23)
668 if (!_is_set_384_data)
670 CRYPTO_w_lock(CRYPTO_LOCK_BN);
672 if (!_is_set_384_data)
675 CRYPTO_w_unlock(CRYPTO_LOCK_BN);
678 tmp_int = BN_ucmp(field, a);
681 else if (tmp_int > 0)
682 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
685 if (!BN_ncopy(r, a, BN_NIST_384_TOP))
694 BN_CASE_32_BIT(23, a_d)
695 BN_CASE_32_BIT(22, a_d)
696 BN_CASE_32_BIT(21, a_d)
697 BN_CASE_32_BIT(20, a_d)
698 BN_CASE_32_BIT(19, a_d)
699 BN_CASE_32_BIT(18, a_d)
700 BN_CASE_32_BIT(17, a_d)
701 BN_CASE_32_BIT(16, a_d)
702 BN_CASE_32_BIT(15, a_d)
703 BN_CASE_32_BIT(14, a_d)
704 BN_CASE_32_BIT(13, a_d)
705 BN_CASE_32_BIT(12, a_d)
707 default: /* a->top == field->top */
708 return BN_usub(r, a, field);
712 BN_256_SET(t_d,0,0,0,0,0,23,22,21)
715 register BN_ULONG *ap,t,c;
718 for (tmp_int=BN_NIST_256_TOP; tmp_int != 0; --tmp_int)
721 *(ap++)=((t<<1)|c)&BN_MASK2;
725 if (bn_add_words(r_d+(128/BN_BITS2), r_d+(128/BN_BITS2),
726 t_d, BN_NIST_256_TOP))
729 BN_384_SET(t_d,23,22,21,20,19,18,17,16,15,14,13,12)
730 if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
733 BN_384_SET(t_d,20,19,18,17,16,15,14,13,12,23,22,21)
734 if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
737 BN_384_SET(t_d,19,18,17,16,15,14,13,12,20,0,23,0)
738 if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
741 BN_256_SET(t_d,0,0,0,0,23,22,21,20)
742 if (bn_add_words(r_d+(128/BN_BITS2), r_d+(128/BN_BITS2),
743 t_d, BN_NIST_256_TOP))
746 BN_384_SET(t_d,0,0,0,0,0,0,23,22,21,0,0,20)
747 if (bn_add_words(r_d, r_d, t_d, BN_NIST_384_TOP))
750 BN_384_SET(t_d,22,21,20,19,18,17,16,15,14,13,12,23)
751 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP))
754 BN_384_SET(t_d,0,0,0,0,0,0,0,23,22,21,20,0)
755 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP))
758 BN_384_SET(t_d,0,0,0,0,0,0,0,23,23,0,0,0)
759 if (bn_sub_words(r_d, r_d, t_d, BN_NIST_384_TOP))
765 bn_sub_words(r_d, r_d, _384_data + BN_NIST_384_TOP *
766 --carry, BN_NIST_384_TOP);
770 bn_add_words(r_d, r_d, _384_data + BN_NIST_384_TOP *
771 --carry, BN_NIST_384_TOP);
775 r->top = BN_NIST_384_TOP;
781 if (BN_ucmp(r, field) >= 0)
783 bn_sub_words(r_d, r_d, _nist_p_384, BN_NIST_384_TOP);
792 int BN_nist_mod_521(BIGNUM *r, const BIGNUM *a, const BIGNUM *field,
796 #define BN_NIST_521_TOP_MASK (BN_ULONG)0x1FF
798 #define BN_NIST_521_TOP_MASK (BN_ULONG)0x1FF
800 #define BN_NIST_521_TOP_MASK (BN_ULONG)0x1FF
802 #define BN_NIST_521_TOP_MASK (BN_ULONG)0x1
808 /* check whether a reduction is necessary */
810 if (top < BN_NIST_521_TOP || ( top == BN_NIST_521_TOP &&
811 (!(a->d[BN_NIST_521_TOP-1] & ~(BN_NIST_521_TOP_MASK)))))
812 return (r == a)? 1 : (BN_copy(r ,a) != NULL);
815 tmp = BN_CTX_get(ctx);
819 if (!BN_ncopy(tmp, a, BN_NIST_521_TOP))
821 if (!BN_rshift(r, a, 521))
824 if (tmp->top == BN_NIST_521_TOP)
825 tmp->d[BN_NIST_521_TOP-1] &= BN_NIST_521_TOP_MASK;
828 if (!BN_uadd(r, tmp, r))
832 if (top == BN_NIST_521_TOP &&
833 (r_d[BN_NIST_521_TOP-1] & ~(BN_NIST_521_TOP_MASK)))
836 r_d[BN_NIST_521_TOP-1] &= BN_NIST_521_TOP_MASK;