1 /* crypto/bn/bn_gf2m.c */
2 /* ====================================================================
3 * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED.
5 * The Elliptic Curve Public-Key Crypto Library (ECC Code) included
6 * herein is developed by SUN MICROSYSTEMS, INC., and is contributed
7 * to the OpenSSL project.
9 * The ECC Code is licensed pursuant to the OpenSSL open source
10 * license provided below.
12 * In addition, Sun covenants to all licensees who provide a reciprocal
13 * covenant with respect to their own patents if any, not to sue under
14 * current and future patent claims necessarily infringed by the making,
15 * using, practicing, selling, offering for sale and/or otherwise
16 * disposing of the ECC Code as delivered hereunder (or portions thereof),
17 * provided that such covenant shall not apply:
18 * 1) for code that a licensee deletes from the ECC Code;
19 * 2) separates from the ECC Code; or
20 * 3) for infringements caused by:
21 * i) the modification of the ECC Code or
22 * ii) the combination of the ECC Code with other software or
23 * devices where such combination causes the infringement.
25 * The software is originally written by Sheueling Chang Shantz and
26 * Douglas Stebila of Sun Microsystems Laboratories.
30 /* NOTE: This file is licensed pursuant to the OpenSSL license below
31 * and may be modified; but after modifications, the above covenant
32 * may no longer apply! In such cases, the corresponding paragraph
33 * ["In addition, Sun covenants ... causes the infringement."] and
34 * this note can be edited out; but please keep the Sun copyright
35 * notice and attribution. */
37 /* ====================================================================
38 * Copyright (c) 1998-2002 The OpenSSL Project. All rights reserved.
40 * Redistribution and use in source and binary forms, with or without
41 * modification, are permitted provided that the following conditions
44 * 1. Redistributions of source code must retain the above copyright
45 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in
49 * the documentation and/or other materials provided with the
52 * 3. All advertising materials mentioning features or use of this
53 * software must display the following acknowledgment:
54 * "This product includes software developed by the OpenSSL Project
55 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
57 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
58 * endorse or promote products derived from this software without
59 * prior written permission. For written permission, please contact
60 * openssl-core@openssl.org.
62 * 5. Products derived from this software may not be called "OpenSSL"
63 * nor may "OpenSSL" appear in their names without prior written
64 * permission of the OpenSSL Project.
66 * 6. Redistributions of any form whatsoever must retain the following
68 * "This product includes software developed by the OpenSSL Project
69 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
71 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
72 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
73 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
74 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
75 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
76 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
77 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
78 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
79 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
80 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
81 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
82 * OF THE POSSIBILITY OF SUCH DAMAGE.
83 * ====================================================================
85 * This product includes cryptographic software written by Eric Young
86 * (eay@cryptsoft.com). This product includes software written by Tim
87 * Hudson (tjh@cryptsoft.com).
97 /* Maximum number of iterations before BN_GF2m_mod_solve_quad_arr should fail. */
98 #define MAX_ITERATIONS 50
100 static const BN_ULONG SQR_tb[16] =
101 { 0, 1, 4, 5, 16, 17, 20, 21,
102 64, 65, 68, 69, 80, 81, 84, 85 };
103 /* Platform-specific macros to accelerate squaring. */
104 #if defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
106 SQR_tb[(w) >> 60 & 0xF] << 56 | SQR_tb[(w) >> 56 & 0xF] << 48 | \
107 SQR_tb[(w) >> 52 & 0xF] << 40 | SQR_tb[(w) >> 48 & 0xF] << 32 | \
108 SQR_tb[(w) >> 44 & 0xF] << 24 | SQR_tb[(w) >> 40 & 0xF] << 16 | \
109 SQR_tb[(w) >> 36 & 0xF] << 8 | SQR_tb[(w) >> 32 & 0xF]
111 SQR_tb[(w) >> 28 & 0xF] << 56 | SQR_tb[(w) >> 24 & 0xF] << 48 | \
112 SQR_tb[(w) >> 20 & 0xF] << 40 | SQR_tb[(w) >> 16 & 0xF] << 32 | \
113 SQR_tb[(w) >> 12 & 0xF] << 24 | SQR_tb[(w) >> 8 & 0xF] << 16 | \
114 SQR_tb[(w) >> 4 & 0xF] << 8 | SQR_tb[(w) & 0xF]
116 #ifdef THIRTY_TWO_BIT
118 SQR_tb[(w) >> 28 & 0xF] << 24 | SQR_tb[(w) >> 24 & 0xF] << 16 | \
119 SQR_tb[(w) >> 20 & 0xF] << 8 | SQR_tb[(w) >> 16 & 0xF]
121 SQR_tb[(w) >> 12 & 0xF] << 24 | SQR_tb[(w) >> 8 & 0xF] << 16 | \
122 SQR_tb[(w) >> 4 & 0xF] << 8 | SQR_tb[(w) & 0xF]
126 SQR_tb[(w) >> 12 & 0xF] << 8 | SQR_tb[(w) >> 8 & 0xF]
128 SQR_tb[(w) >> 4 & 0xF] << 8 | SQR_tb[(w) & 0xF]
132 SQR_tb[(w) >> 4 & 0xF]
137 /* Product of two polynomials a, b each with degree < BN_BITS2 - 1,
138 * result is a polynomial r with degree < 2 * BN_BITS - 1
139 * The caller MUST ensure that the variables have the right amount
140 * of space allocated.
143 static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
145 register BN_ULONG h, l, s;
146 BN_ULONG tab[4], top1b = a >> 7;
147 register BN_ULONG a1, a2;
149 a1 = a & (0x7F); a2 = a1 << 1;
151 tab[0] = 0; tab[1] = a1; tab[2] = a2; tab[3] = a1^a2;
153 s = tab[b & 0x3]; l = s;
154 s = tab[b >> 2 & 0x3]; l ^= s << 2; h = s >> 6;
155 s = tab[b >> 4 & 0x3]; l ^= s << 4; h ^= s >> 4;
156 s = tab[b >> 6 ]; l ^= s << 6; h ^= s >> 2;
158 /* compensate for the top bit of a */
160 if (top1b & 01) { l ^= b << 7; h ^= b >> 1; }
166 static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
168 register BN_ULONG h, l, s;
169 BN_ULONG tab[4], top1b = a >> 15;
170 register BN_ULONG a1, a2;
172 a1 = a & (0x7FFF); a2 = a1 << 1;
174 tab[0] = 0; tab[1] = a1; tab[2] = a2; tab[3] = a1^a2;
176 s = tab[b & 0x3]; l = s;
177 s = tab[b >> 2 & 0x3]; l ^= s << 2; h = s >> 14;
178 s = tab[b >> 4 & 0x3]; l ^= s << 4; h ^= s >> 12;
179 s = tab[b >> 6 & 0x3]; l ^= s << 6; h ^= s >> 10;
180 s = tab[b >> 8 & 0x3]; l ^= s << 8; h ^= s >> 8;
181 s = tab[b >>10 & 0x3]; l ^= s << 10; h ^= s >> 6;
182 s = tab[b >>12 & 0x3]; l ^= s << 12; h ^= s >> 4;
183 s = tab[b >>14 ]; l ^= s << 14; h ^= s >> 2;
185 /* compensate for the top bit of a */
187 if (top1b & 01) { l ^= b << 15; h ^= b >> 1; }
192 #ifdef THIRTY_TWO_BIT
193 static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
195 register BN_ULONG h, l, s;
196 BN_ULONG tab[8], top2b = a >> 30;
197 register BN_ULONG a1, a2, a4;
199 a1 = a & (0x3FFFFFFF); a2 = a1 << 1; a4 = a2 << 1;
201 tab[0] = 0; tab[1] = a1; tab[2] = a2; tab[3] = a1^a2;
202 tab[4] = a4; tab[5] = a1^a4; tab[6] = a2^a4; tab[7] = a1^a2^a4;
204 s = tab[b & 0x7]; l = s;
205 s = tab[b >> 3 & 0x7]; l ^= s << 3; h = s >> 29;
206 s = tab[b >> 6 & 0x7]; l ^= s << 6; h ^= s >> 26;
207 s = tab[b >> 9 & 0x7]; l ^= s << 9; h ^= s >> 23;
208 s = tab[b >> 12 & 0x7]; l ^= s << 12; h ^= s >> 20;
209 s = tab[b >> 15 & 0x7]; l ^= s << 15; h ^= s >> 17;
210 s = tab[b >> 18 & 0x7]; l ^= s << 18; h ^= s >> 14;
211 s = tab[b >> 21 & 0x7]; l ^= s << 21; h ^= s >> 11;
212 s = tab[b >> 24 & 0x7]; l ^= s << 24; h ^= s >> 8;
213 s = tab[b >> 27 & 0x7]; l ^= s << 27; h ^= s >> 5;
214 s = tab[b >> 30 ]; l ^= s << 30; h ^= s >> 2;
216 /* compensate for the top two bits of a */
218 if (top2b & 01) { l ^= b << 30; h ^= b >> 2; }
219 if (top2b & 02) { l ^= b << 31; h ^= b >> 1; }
224 #if defined(SIXTY_FOUR_BIT) || defined(SIXTY_FOUR_BIT_LONG)
225 static void bn_GF2m_mul_1x1(BN_ULONG *r1, BN_ULONG *r0, const BN_ULONG a, const BN_ULONG b)
227 register BN_ULONG h, l, s;
228 BN_ULONG tab[16], top3b = a >> 61;
229 register BN_ULONG a1, a2, a4, a8;
231 a1 = a & (0x1FFFFFFFFFFFFFFFULL); a2 = a1 << 1; a4 = a2 << 1; a8 = a4 << 1;
233 tab[ 0] = 0; tab[ 1] = a1; tab[ 2] = a2; tab[ 3] = a1^a2;
234 tab[ 4] = a4; tab[ 5] = a1^a4; tab[ 6] = a2^a4; tab[ 7] = a1^a2^a4;
235 tab[ 8] = a8; tab[ 9] = a1^a8; tab[10] = a2^a8; tab[11] = a1^a2^a8;
236 tab[12] = a4^a8; tab[13] = a1^a4^a8; tab[14] = a2^a4^a8; tab[15] = a1^a2^a4^a8;
238 s = tab[b & 0xF]; l = s;
239 s = tab[b >> 4 & 0xF]; l ^= s << 4; h = s >> 60;
240 s = tab[b >> 8 & 0xF]; l ^= s << 8; h ^= s >> 56;
241 s = tab[b >> 12 & 0xF]; l ^= s << 12; h ^= s >> 52;
242 s = tab[b >> 16 & 0xF]; l ^= s << 16; h ^= s >> 48;
243 s = tab[b >> 20 & 0xF]; l ^= s << 20; h ^= s >> 44;
244 s = tab[b >> 24 & 0xF]; l ^= s << 24; h ^= s >> 40;
245 s = tab[b >> 28 & 0xF]; l ^= s << 28; h ^= s >> 36;
246 s = tab[b >> 32 & 0xF]; l ^= s << 32; h ^= s >> 32;
247 s = tab[b >> 36 & 0xF]; l ^= s << 36; h ^= s >> 28;
248 s = tab[b >> 40 & 0xF]; l ^= s << 40; h ^= s >> 24;
249 s = tab[b >> 44 & 0xF]; l ^= s << 44; h ^= s >> 20;
250 s = tab[b >> 48 & 0xF]; l ^= s << 48; h ^= s >> 16;
251 s = tab[b >> 52 & 0xF]; l ^= s << 52; h ^= s >> 12;
252 s = tab[b >> 56 & 0xF]; l ^= s << 56; h ^= s >> 8;
253 s = tab[b >> 60 ]; l ^= s << 60; h ^= s >> 4;
255 /* compensate for the top three bits of a */
257 if (top3b & 01) { l ^= b << 61; h ^= b >> 3; }
258 if (top3b & 02) { l ^= b << 62; h ^= b >> 2; }
259 if (top3b & 04) { l ^= b << 63; h ^= b >> 1; }
265 /* Product of two polynomials a, b each with degree < 2 * BN_BITS2 - 1,
266 * result is a polynomial r with degree < 4 * BN_BITS2 - 1
267 * The caller MUST ensure that the variables have the right amount
268 * of space allocated.
270 static void bn_GF2m_mul_2x2(BN_ULONG *r, const BN_ULONG a1, const BN_ULONG a0, const BN_ULONG b1, const BN_ULONG b0)
273 /* r[3] = h1, r[2] = h0; r[1] = l1; r[0] = l0 */
274 bn_GF2m_mul_1x1(r+3, r+2, a1, b1);
275 bn_GF2m_mul_1x1(r+1, r, a0, b0);
276 bn_GF2m_mul_1x1(&m1, &m0, a0 ^ a1, b0 ^ b1);
277 /* Correction on m1 ^= l1 ^ h1; m0 ^= l0 ^ h0; */
278 r[2] ^= m1 ^ r[1] ^ r[3]; /* h0 ^= m1 ^ l1 ^ h1; */
279 r[1] = r[3] ^ r[2] ^ r[0] ^ m1 ^ m0; /* l1 ^= l0 ^ h0 ^ m0; */
283 /* Add polynomials a and b and store result in r; r could be a or b, a and b
284 * could be equal; r is the bitwise XOR of a and b.
286 int BN_GF2m_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b)
289 const BIGNUM *at, *bt;
294 if (a->top < b->top) { at = b; bt = a; }
295 else { at = a; bt = b; }
297 if(bn_wexpand(r, at->top) == NULL)
300 for (i = 0; i < bt->top; i++)
302 r->d[i] = at->d[i] ^ bt->d[i];
304 for (; i < at->top; i++)
316 /* Some functions allow for representation of the irreducible polynomials
317 * as an int[], say p. The irreducible f(t) is then of the form:
318 * t^p[0] + t^p[1] + ... + t^p[k]
319 * where m = p[0] > p[1] > ... > p[k] = 0.
323 /* Performs modular reduction of a and store result in r. r could be a. */
324 int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[])
334 /* reduction mod 1 => return 0 */
339 /* Since the algorithm does reduction in the r value, if a != r, copy
340 * the contents of a into r so we can do reduction in r.
344 if (!bn_wexpand(r, a->top)) return 0;
345 for (j = 0; j < a->top; j++)
353 /* start reduction */
354 dN = p[0] / BN_BITS2;
355 for (j = r->top - 1; j > dN;)
358 if (z[j] == 0) { j--; continue; }
361 for (k = 1; p[k] != 0; k++)
363 /* reducing component t^p[k] */
365 d0 = n % BN_BITS2; d1 = BN_BITS2 - d0;
368 if (d0) z[j-n-1] ^= (zz<<d1);
371 /* reducing component t^0 */
373 d0 = p[0] % BN_BITS2;
375 z[j-n] ^= (zz >> d0);
376 if (d0) z[j-n-1] ^= (zz << d1);
379 /* final round of reduction */
383 d0 = p[0] % BN_BITS2;
388 /* clear up the top d1 bits */
390 z[dN] = (z[dN] << d1) >> d1;
393 z[0] ^= zz; /* reduction t^0 component */
395 for (k = 1; p[k] != 0; k++)
399 /* reducing component t^p[k]*/
401 d0 = p[k] % BN_BITS2;
404 tmp_ulong = zz >> d1;
416 /* Performs modular reduction of a by p and store result in r. r could be a.
418 * This function calls down to the BN_GF2m_mod_arr implementation; this wrapper
419 * function is only provided for convenience; for best performance, use the
420 * BN_GF2m_mod_arr function.
422 int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p)
425 const int max = BN_num_bits(p);
426 unsigned int *arr=NULL;
429 if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
430 ret = BN_GF2m_poly2arr(p, arr, max);
431 if (!ret || ret > max)
433 BNerr(BN_F_BN_GF2M_MOD,BN_R_INVALID_LENGTH);
436 ret = BN_GF2m_mod_arr(r, a, arr);
439 if (arr) OPENSSL_free(arr);
444 /* Compute the product of two polynomials a and b, reduce modulo p, and store
445 * the result in r. r could be a or b; a could be b.
447 int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const unsigned int p[], BN_CTX *ctx)
449 int zlen, i, j, k, ret = 0;
451 BN_ULONG x1, x0, y1, y0, zz[4];
458 return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
462 if ((s = BN_CTX_get(ctx)) == NULL) goto err;
464 zlen = a->top + b->top + 4;
465 if (!bn_wexpand(s, zlen)) goto err;
468 for (i = 0; i < zlen; i++) s->d[i] = 0;
470 for (j = 0; j < b->top; j += 2)
473 y1 = ((j+1) == b->top) ? 0 : b->d[j+1];
474 for (i = 0; i < a->top; i += 2)
477 x1 = ((i+1) == a->top) ? 0 : a->d[i+1];
478 bn_GF2m_mul_2x2(zz, x1, x0, y1, y0);
479 for (k = 0; k < 4; k++) s->d[i+j+k] ^= zz[k];
484 if (BN_GF2m_mod_arr(r, s, p))
493 /* Compute the product of two polynomials a and b, reduce modulo p, and store
494 * the result in r. r could be a or b; a could equal b.
496 * This function calls down to the BN_GF2m_mod_mul_arr implementation; this wrapper
497 * function is only provided for convenience; for best performance, use the
498 * BN_GF2m_mod_mul_arr function.
500 int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx)
503 const int max = BN_num_bits(p);
504 unsigned int *arr=NULL;
508 if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
509 ret = BN_GF2m_poly2arr(p, arr, max);
510 if (!ret || ret > max)
512 BNerr(BN_F_BN_GF2M_MOD_MUL,BN_R_INVALID_LENGTH);
515 ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
518 if (arr) OPENSSL_free(arr);
523 /* Square a, reduce the result mod p, and store it in a. r could be a. */
524 int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
531 if ((s = BN_CTX_get(ctx)) == NULL) return 0;
532 if (!bn_wexpand(s, 2 * a->top)) goto err;
534 for (i = a->top - 1; i >= 0; i--)
536 s->d[2*i+1] = SQR1(a->d[i]);
537 s->d[2*i ] = SQR0(a->d[i]);
542 if (!BN_GF2m_mod_arr(r, s, p)) goto err;
550 /* Square a, reduce the result mod p, and store it in a. r could be a.
552 * This function calls down to the BN_GF2m_mod_sqr_arr implementation; this wrapper
553 * function is only provided for convenience; for best performance, use the
554 * BN_GF2m_mod_sqr_arr function.
556 int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
559 const int max = BN_num_bits(p);
560 unsigned int *arr=NULL;
564 if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
565 ret = BN_GF2m_poly2arr(p, arr, max);
566 if (!ret || ret > max)
568 BNerr(BN_F_BN_GF2M_MOD_SQR,BN_R_INVALID_LENGTH);
571 ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx);
574 if (arr) OPENSSL_free(arr);
579 /* Invert a, reduce modulo p, and store the result in r. r could be a.
580 * Uses Modified Almost Inverse Algorithm (Algorithm 10) from
581 * Hankerson, D., Hernandez, J.L., and Menezes, A. "Software Implementation
582 * of Elliptic Curve Cryptography Over Binary Fields".
584 int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
586 BIGNUM *b, *c, *u, *v, *tmp;
598 if (v == NULL) goto err;
600 if (!BN_one(b)) goto err;
601 if (!BN_GF2m_mod(u, a, p)) goto err;
602 if (!BN_copy(v, p)) goto err;
604 if (BN_is_zero(u)) goto err;
608 while (!BN_is_odd(u))
610 if (BN_is_zero(u)) goto err;
611 if (!BN_rshift1(u, u)) goto err;
614 if (!BN_GF2m_add(b, b, p)) goto err;
616 if (!BN_rshift1(b, b)) goto err;
619 if (BN_abs_is_word(u, 1)) break;
621 if (BN_num_bits(u) < BN_num_bits(v))
623 tmp = u; u = v; v = tmp;
624 tmp = b; b = c; c = tmp;
627 if (!BN_GF2m_add(u, u, v)) goto err;
628 if (!BN_GF2m_add(b, b, c)) goto err;
632 if (!BN_copy(r, b)) goto err;
641 /* Invert xx, reduce modulo p, and store the result in r. r could be xx.
643 * This function calls down to the BN_GF2m_mod_inv implementation; this wrapper
644 * function is only provided for convenience; for best performance, use the
645 * BN_GF2m_mod_inv function.
647 int BN_GF2m_mod_inv_arr(BIGNUM *r, const BIGNUM *xx, const unsigned int p[], BN_CTX *ctx)
654 if ((field = BN_CTX_get(ctx)) == NULL) goto err;
655 if (!BN_GF2m_arr2poly(p, field)) goto err;
657 ret = BN_GF2m_mod_inv(r, xx, field, ctx);
666 #ifndef OPENSSL_SUN_GF2M_DIV
667 /* Divide y by x, reduce modulo p, and store the result in r. r could be x
668 * or y, x could equal y.
670 int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *y, const BIGNUM *x, const BIGNUM *p, BN_CTX *ctx)
680 xinv = BN_CTX_get(ctx);
681 if (xinv == NULL) goto err;
683 if (!BN_GF2m_mod_inv(xinv, x, p, ctx)) goto err;
684 if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx)) goto err;
693 /* Divide y by x, reduce modulo p, and store the result in r. r could be x
694 * or y, x could equal y.
695 * Uses algorithm Modular_Division_GF(2^m) from
696 * Chang-Shantz, S. "From Euclid's GCD to Montgomery Multiplication to
699 int BN_GF2m_mod_div(BIGNUM *r, const BIGNUM *y, const BIGNUM *x, const BIGNUM *p, BN_CTX *ctx)
701 BIGNUM *a, *b, *u, *v;
714 if (v == NULL) goto err;
716 /* reduce x and y mod p */
717 if (!BN_GF2m_mod(u, y, p)) goto err;
718 if (!BN_GF2m_mod(a, x, p)) goto err;
719 if (!BN_copy(b, p)) goto err;
721 while (!BN_is_odd(a))
723 if (!BN_rshift1(a, a)) goto err;
724 if (BN_is_odd(u)) if (!BN_GF2m_add(u, u, p)) goto err;
725 if (!BN_rshift1(u, u)) goto err;
730 if (BN_GF2m_cmp(b, a) > 0)
732 if (!BN_GF2m_add(b, b, a)) goto err;
733 if (!BN_GF2m_add(v, v, u)) goto err;
736 if (!BN_rshift1(b, b)) goto err;
737 if (BN_is_odd(v)) if (!BN_GF2m_add(v, v, p)) goto err;
738 if (!BN_rshift1(v, v)) goto err;
739 } while (!BN_is_odd(b));
741 else if (BN_abs_is_word(a, 1))
745 if (!BN_GF2m_add(a, a, b)) goto err;
746 if (!BN_GF2m_add(u, u, v)) goto err;
749 if (!BN_rshift1(a, a)) goto err;
750 if (BN_is_odd(u)) if (!BN_GF2m_add(u, u, p)) goto err;
751 if (!BN_rshift1(u, u)) goto err;
752 } while (!BN_is_odd(a));
756 if (!BN_copy(r, u)) goto err;
766 /* Divide yy by xx, reduce modulo p, and store the result in r. r could be xx
767 * or yy, xx could equal yy.
769 * This function calls down to the BN_GF2m_mod_div implementation; this wrapper
770 * function is only provided for convenience; for best performance, use the
771 * BN_GF2m_mod_div function.
773 int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *yy, const BIGNUM *xx, const unsigned int p[], BN_CTX *ctx)
782 if ((field = BN_CTX_get(ctx)) == NULL) goto err;
783 if (!BN_GF2m_arr2poly(p, field)) goto err;
785 ret = BN_GF2m_mod_div(r, yy, xx, field, ctx);
794 /* Compute the bth power of a, reduce modulo p, and store
795 * the result in r. r could be a.
796 * Uses simple square-and-multiply algorithm A.5.1 from IEEE P1363.
798 int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const unsigned int p[], BN_CTX *ctx)
809 if (BN_abs_is_word(b, 1))
810 return (BN_copy(r, a) != NULL);
813 if ((u = BN_CTX_get(ctx)) == NULL) goto err;
815 if (!BN_GF2m_mod_arr(u, a, p)) goto err;
817 n = BN_num_bits(b) - 1;
818 for (i = n - 1; i >= 0; i--)
820 if (!BN_GF2m_mod_sqr_arr(u, u, p, ctx)) goto err;
821 if (BN_is_bit_set(b, i))
823 if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx)) goto err;
826 if (!BN_copy(r, u)) goto err;
834 /* Compute the bth power of a, reduce modulo p, and store
835 * the result in r. r could be a.
837 * This function calls down to the BN_GF2m_mod_exp_arr implementation; this wrapper
838 * function is only provided for convenience; for best performance, use the
839 * BN_GF2m_mod_exp_arr function.
841 int BN_GF2m_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *p, BN_CTX *ctx)
844 const int max = BN_num_bits(p);
845 unsigned int *arr=NULL;
849 if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
850 ret = BN_GF2m_poly2arr(p, arr, max);
851 if (!ret || ret > max)
853 BNerr(BN_F_BN_GF2M_MOD_EXP,BN_R_INVALID_LENGTH);
856 ret = BN_GF2m_mod_exp_arr(r, a, b, arr, ctx);
859 if (arr) OPENSSL_free(arr);
863 /* Compute the square root of a, reduce modulo p, and store
864 * the result in r. r could be a.
865 * Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
867 int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const unsigned int p[], BN_CTX *ctx)
876 /* reduction mod 1 => return 0 */
882 if ((u = BN_CTX_get(ctx)) == NULL) goto err;
884 if (!BN_set_bit(u, p[0] - 1)) goto err;
885 ret = BN_GF2m_mod_exp_arr(r, a, u, p, ctx);
893 /* Compute the square root of a, reduce modulo p, and store
894 * the result in r. r could be a.
896 * This function calls down to the BN_GF2m_mod_sqrt_arr implementation; this wrapper
897 * function is only provided for convenience; for best performance, use the
898 * BN_GF2m_mod_sqrt_arr function.
900 int BN_GF2m_mod_sqrt(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
903 const int max = BN_num_bits(p);
904 unsigned int *arr=NULL;
907 if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max)) == NULL) goto err;
908 ret = BN_GF2m_poly2arr(p, arr, max);
909 if (!ret || ret > max)
911 BNerr(BN_F_BN_GF2M_MOD_SQRT,BN_R_INVALID_LENGTH);
914 ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx);
917 if (arr) OPENSSL_free(arr);
921 /* Find r such that r^2 + r = a mod p. r could be a. If no r exists returns 0.
922 * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
924 int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const unsigned int p[], BN_CTX *ctx)
926 int ret = 0, count = 0;
928 BIGNUM *a, *z, *rho, *w, *w2, *tmp;
934 /* reduction mod 1 => return 0 */
943 if (w == NULL) goto err;
945 if (!BN_GF2m_mod_arr(a, a_, p)) goto err;
954 if (p[0] & 0x1) /* m is odd */
956 /* compute half-trace of a */
957 if (!BN_copy(z, a)) goto err;
958 for (j = 1; j <= (p[0] - 1) / 2; j++)
960 if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
961 if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
962 if (!BN_GF2m_add(z, z, a)) goto err;
968 rho = BN_CTX_get(ctx);
969 w2 = BN_CTX_get(ctx);
970 tmp = BN_CTX_get(ctx);
971 if (tmp == NULL) goto err;
974 if (!BN_rand(rho, p[0], 0, 0)) goto err;
975 if (!BN_GF2m_mod_arr(rho, rho, p)) goto err;
977 if (!BN_copy(w, rho)) goto err;
978 for (j = 1; j <= p[0] - 1; j++)
980 if (!BN_GF2m_mod_sqr_arr(z, z, p, ctx)) goto err;
981 if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx)) goto err;
982 if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx)) goto err;
983 if (!BN_GF2m_add(z, z, tmp)) goto err;
984 if (!BN_GF2m_add(w, w2, rho)) goto err;
987 } while (BN_is_zero(w) && (count < MAX_ITERATIONS));
990 BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR,BN_R_TOO_MANY_ITERATIONS);
995 if (!BN_GF2m_mod_sqr_arr(w, z, p, ctx)) goto err;
996 if (!BN_GF2m_add(w, z, w)) goto err;
997 if (BN_GF2m_cmp(w, a))
999 BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR, BN_R_NO_SOLUTION);
1003 if (!BN_copy(r, z)) goto err;
1013 /* Find r such that r^2 + r = a mod p. r could be a. If no r exists returns 0.
1015 * This function calls down to the BN_GF2m_mod_solve_quad_arr implementation; this wrapper
1016 * function is only provided for convenience; for best performance, use the
1017 * BN_GF2m_mod_solve_quad_arr function.
1019 int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
1022 const int max = BN_num_bits(p);
1023 unsigned int *arr=NULL;
1026 if ((arr = (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) *
1027 max)) == NULL) goto err;
1028 ret = BN_GF2m_poly2arr(p, arr, max);
1029 if (!ret || ret > max)
1031 BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD,BN_R_INVALID_LENGTH);
1034 ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx);
1037 if (arr) OPENSSL_free(arr);
1041 /* Convert the bit-string representation of a polynomial
1042 * ( \sum_{i=0}^n a_i * x^i , where a_0 is *not* zero) into an array
1043 * of integers corresponding to the bits with non-zero coefficient.
1044 * Up to max elements of the array will be filled. Return value is total
1045 * number of coefficients that would be extracted if array was large enough.
1047 int BN_GF2m_poly2arr(const BIGNUM *a, unsigned int p[], int max)
1052 if (BN_is_zero(a) || !BN_is_bit_set(a, 0))
1053 /* a_0 == 0 => return error (the unsigned int array
1054 * must be terminated by 0)
1058 for (i = a->top - 1; i >= 0; i--)
1061 /* skip word if a->d[i] == 0 */
1064 for (j = BN_BITS2 - 1; j >= 0; j--)
1068 if (k < max) p[k] = BN_BITS2 * i + j;
1078 /* Convert the coefficient array representation of a polynomial to a
1079 * bit-string. The array must be terminated by 0.
1081 int BN_GF2m_arr2poly(const unsigned int p[], BIGNUM *a)
1087 for (i = 0; p[i] != 0; i++)
1089 if (BN_set_bit(a, p[i]) == 0)
1099 * Constant-time conditional swap of a and b.
1100 * a and b are swapped if condition is not 0. The code assumes that at most one bit of condition is set.
1101 * nwords is the number of words to swap. The code assumes that at least nwords are allocated in both a and b,
1102 * and that no more than nwords are used by either a or b.
1103 * a and b cannot be the same number
1105 void BN_consttime_swap(BN_ULONG condition, BIGNUM *a, BIGNUM *b, int nwords)
1110 bn_wcheck_size(a, nwords);
1111 bn_wcheck_size(b, nwords);
1114 assert((condition & (condition - 1)) == 0);
1115 assert(sizeof(BN_ULONG) >= sizeof(int));
1117 condition = ((condition - 1) >> (BN_BITS2 - 1)) - 1;
1119 t = (a->top^b->top) & condition;
1123 #define BN_CONSTTIME_SWAP(ind) \
1125 t = (a->d[ind] ^ b->d[ind]) & condition; \
1133 for (i = 10; i < nwords; i++)
1134 BN_CONSTTIME_SWAP(i);
1136 case 10: BN_CONSTTIME_SWAP(9); /* Fallthrough */
1137 case 9: BN_CONSTTIME_SWAP(8); /* Fallthrough */
1138 case 8: BN_CONSTTIME_SWAP(7); /* Fallthrough */
1139 case 7: BN_CONSTTIME_SWAP(6); /* Fallthrough */
1140 case 6: BN_CONSTTIME_SWAP(5); /* Fallthrough */
1141 case 5: BN_CONSTTIME_SWAP(4); /* Fallthrough */
1142 case 4: BN_CONSTTIME_SWAP(3); /* Fallthrough */
1143 case 3: BN_CONSTTIME_SWAP(2); /* Fallthrough */
1144 case 2: BN_CONSTTIME_SWAP(1); /* Fallthrough */
1145 case 1: BN_CONSTTIME_SWAP(0);
1147 #undef BN_CONSTTIME_SWAP