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
& (0x1FFFFFFFFFFFFFFF); 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
;
291 if (a
->top
< b
->top
) { at
= b
; bt
= a
; }
292 else { at
= a
; bt
= b
; }
294 bn_wexpand(r
, at
->top
);
296 for (i
= 0; i
< bt
->top
; i
++)
298 r
->d
[i
] = at
->d
[i
] ^ bt
->d
[i
];
300 for (; i
< at
->top
; i
++)
312 /* Some functions allow for representation of the irreducible polynomials
313 * as an int[], say p. The irreducible f(t) is then of the form:
314 * t^p[0] + t^p[1] + ... + t^p[k]
315 * where m = p[0] > p[1] > ... > p[k] = 0.
319 /* Performs modular reduction of a and store result in r. r could be a. */
320 int BN_GF2m_mod_arr(BIGNUM
*r
, const BIGNUM
*a
, const unsigned int p
[])
327 /* reduction mod 1 => return 0 */
330 /* Since the algorithm does reduction in the r value, if a != r, copy
331 * the contents of a into r so we can do reduction in r.
335 if (!bn_wexpand(r
, a
->top
)) return 0;
336 for (j
= 0; j
< a
->top
; j
++)
344 /* start reduction */
345 dN
= p
[0] / BN_BITS2
;
346 for (j
= r
->top
- 1; j
> dN
;)
349 if (z
[j
] == 0) { j
--; continue; }
352 for (k
= 1; p
[k
] != 0; k
++)
354 /* reducing component t^p[k] */
356 d0
= n
% BN_BITS2
; d1
= BN_BITS2
- d0
;
359 if (d0
) z
[j
-n
-1] ^= (zz
<<d1
);
362 /* reducing component t^0 */
364 d0
= p
[0] % BN_BITS2
;
366 z
[j
-n
] ^= (zz
>> d0
);
367 if (d0
) z
[j
-n
-1] ^= (zz
<< d1
);
370 /* final round of reduction */
374 d0
= p
[0] % BN_BITS2
;
379 if (d0
) z
[dN
] = (z
[dN
] << d1
) >> d1
; /* clear up the top d1 bits */
380 z
[0] ^= zz
; /* reduction t^0 component */
382 for (k
= 1; p
[k
] != 0; k
++)
386 /* reducing component t^p[k]*/
388 d0
= p
[k
] % BN_BITS2
;
391 tmp_ulong
= zz
>> d1
;
404 /* Performs modular reduction of a by p and store result in r. r could be a.
406 * This function calls down to the BN_GF2m_mod_arr implementation; this wrapper
407 * function is only provided for convenience; for best performance, use the
408 * BN_GF2m_mod_arr function.
410 int BN_GF2m_mod(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
)
412 const int max
= BN_num_bits(p
);
413 unsigned int *arr
=NULL
, ret
= 0;
414 if ((arr
= (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max
)) == NULL
) goto err
;
415 ret
= BN_GF2m_poly2arr(p
, arr
, max
);
416 if (!ret
|| ret
> max
)
418 BNerr(BN_F_BN_GF2M_MOD
,BN_R_INVALID_LENGTH
);
421 ret
= BN_GF2m_mod_arr(r
, a
, arr
);
424 if (arr
) OPENSSL_free(arr
);
429 /* Compute the product of two polynomials a and b, reduce modulo p, and store
430 * the result in r. r could be a or b; a could be b.
432 int BN_GF2m_mod_mul_arr(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const unsigned int p
[], BN_CTX
*ctx
)
434 int zlen
, i
, j
, k
, ret
= 0;
436 BN_ULONG x1
, x0
, y1
, y0
, zz
[4];
440 return BN_GF2m_mod_sqr_arr(r
, a
, p
, ctx
);
445 if ((s
= BN_CTX_get(ctx
)) == NULL
) goto err
;
447 zlen
= a
->top
+ b
->top
+ 4;
448 if (!bn_wexpand(s
, zlen
)) goto err
;
451 for (i
= 0; i
< zlen
; i
++) s
->d
[i
] = 0;
453 for (j
= 0; j
< b
->top
; j
+= 2)
456 y1
= ((j
+1) == b
->top
) ? 0 : b
->d
[j
+1];
457 for (i
= 0; i
< a
->top
; i
+= 2)
460 x1
= ((i
+1) == a
->top
) ? 0 : a
->d
[i
+1];
461 bn_GF2m_mul_2x2(zz
, x1
, x0
, y1
, y0
);
462 for (k
= 0; k
< 4; k
++) s
->d
[i
+j
+k
] ^= zz
[k
];
467 if (BN_GF2m_mod_arr(r
, s
, p
))
477 /* Compute the product of two polynomials a and b, reduce modulo p, and store
478 * the result in r. r could be a or b; a could equal b.
480 * This function calls down to the BN_GF2m_mod_mul_arr implementation; this wrapper
481 * function is only provided for convenience; for best performance, use the
482 * BN_GF2m_mod_mul_arr function.
484 int BN_GF2m_mod_mul(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const BIGNUM
*p
, BN_CTX
*ctx
)
486 const int max
= BN_num_bits(p
);
487 unsigned int *arr
=NULL
, ret
= 0;
488 if ((arr
= (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max
)) == NULL
) goto err
;
489 ret
= BN_GF2m_poly2arr(p
, arr
, max
);
490 if (!ret
|| ret
> max
)
492 BNerr(BN_F_BN_GF2M_MOD_MUL
,BN_R_INVALID_LENGTH
);
495 ret
= BN_GF2m_mod_mul_arr(r
, a
, b
, arr
, ctx
);
498 if (arr
) OPENSSL_free(arr
);
503 /* Square a, reduce the result mod p, and store it in a. r could be a. */
504 int BN_GF2m_mod_sqr_arr(BIGNUM
*r
, const BIGNUM
*a
, const unsigned int p
[], BN_CTX
*ctx
)
510 if ((s
= BN_CTX_get(ctx
)) == NULL
) return 0;
511 if (!bn_wexpand(s
, 2 * a
->top
)) goto err
;
513 for (i
= a
->top
- 1; i
>= 0; i
--)
515 s
->d
[2*i
+1] = SQR1(a
->d
[i
]);
516 s
->d
[2*i
] = SQR0(a
->d
[i
]);
521 if (!BN_GF2m_mod_arr(r
, s
, p
)) goto err
;
529 /* Square a, reduce the result mod p, and store it in a. r could be a.
531 * This function calls down to the BN_GF2m_mod_sqr_arr implementation; this wrapper
532 * function is only provided for convenience; for best performance, use the
533 * BN_GF2m_mod_sqr_arr function.
535 int BN_GF2m_mod_sqr(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
, BN_CTX
*ctx
)
537 const int max
= BN_num_bits(p
);
538 unsigned int *arr
=NULL
, ret
= 0;
539 if ((arr
= (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max
)) == NULL
) goto err
;
540 ret
= BN_GF2m_poly2arr(p
, arr
, max
);
541 if (!ret
|| ret
> max
)
543 BNerr(BN_F_BN_GF2M_MOD_SQR
,BN_R_INVALID_LENGTH
);
546 ret
= BN_GF2m_mod_sqr_arr(r
, a
, arr
, ctx
);
549 if (arr
) OPENSSL_free(arr
);
554 /* Invert a, reduce modulo p, and store the result in r. r could be a.
555 * Uses Modified Almost Inverse Algorithm (Algorithm 10) from
556 * Hankerson, D., Hernandez, J.L., and Menezes, A. "Software Implementation
557 * of Elliptic Curve Cryptography Over Binary Fields".
559 int BN_GF2m_mod_inv(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
, BN_CTX
*ctx
)
561 BIGNUM
*b
, *c
, *u
, *v
, *tmp
;
570 if (v
== NULL
) goto err
;
572 if (!BN_one(b
)) goto err
;
573 if (!BN_zero(c
)) goto err
;
574 if (!BN_GF2m_mod(u
, a
, p
)) goto err
;
575 if (!BN_copy(v
, p
)) goto err
;
577 if (BN_is_zero(u
)) goto err
;
581 while (!BN_is_odd(u
))
583 if (!BN_rshift1(u
, u
)) goto err
;
586 if (!BN_GF2m_add(b
, b
, p
)) goto err
;
588 if (!BN_rshift1(b
, b
)) goto err
;
591 if (BN_abs_is_word(u
, 1)) break;
593 if (BN_num_bits(u
) < BN_num_bits(v
))
595 tmp
= u
; u
= v
; v
= tmp
;
596 tmp
= b
; b
= c
; c
= tmp
;
599 if (!BN_GF2m_add(u
, u
, v
)) goto err
;
600 if (!BN_GF2m_add(b
, b
, c
)) goto err
;
604 if (!BN_copy(r
, b
)) goto err
;
613 /* Invert xx, reduce modulo p, and store the result in r. r could be xx.
615 * This function calls down to the BN_GF2m_mod_inv implementation; this wrapper
616 * function is only provided for convenience; for best performance, use the
617 * BN_GF2m_mod_inv function.
619 int BN_GF2m_mod_inv_arr(BIGNUM
*r
, const BIGNUM
*xx
, const unsigned int p
[], BN_CTX
*ctx
)
625 if ((field
= BN_CTX_get(ctx
)) == NULL
) goto err
;
626 if (!BN_GF2m_arr2poly(p
, field
)) goto err
;
628 ret
= BN_GF2m_mod_inv(r
, xx
, field
, ctx
);
637 #ifndef OPENSSL_SUN_GF2M_DIV
638 /* Divide y by x, reduce modulo p, and store the result in r. r could be x
639 * or y, x could equal y.
641 int BN_GF2m_mod_div(BIGNUM
*r
, const BIGNUM
*y
, const BIGNUM
*x
, const BIGNUM
*p
, BN_CTX
*ctx
)
647 xinv
= BN_CTX_get(ctx
);
648 if (xinv
== NULL
) goto err
;
650 if (!BN_GF2m_mod_inv(xinv
, x
, p
, ctx
)) goto err
;
651 if (!BN_GF2m_mod_mul(r
, y
, xinv
, p
, ctx
)) goto err
;
660 /* Divide y by x, reduce modulo p, and store the result in r. r could be x
661 * or y, x could equal y.
662 * Uses algorithm Modular_Division_GF(2^m) from
663 * Chang-Shantz, S. "From Euclid's GCD to Montgomery Multiplication to
666 int BN_GF2m_mod_div(BIGNUM
*r
, const BIGNUM
*y
, const BIGNUM
*x
, const BIGNUM
*p
, BN_CTX
*ctx
)
668 BIGNUM
*a
, *b
, *u
, *v
;
677 if (v
== NULL
) goto err
;
679 /* reduce x and y mod p */
680 if (!BN_GF2m_mod(u
, y
, p
)) goto err
;
681 if (!BN_GF2m_mod(a
, x
, p
)) goto err
;
682 if (!BN_copy(b
, p
)) goto err
;
683 if (!BN_zero(v
)) goto err
;
685 while (!BN_is_odd(a
))
687 if (!BN_rshift1(a
, a
)) goto err
;
688 if (BN_is_odd(u
)) if (!BN_GF2m_add(u
, u
, p
)) goto err
;
689 if (!BN_rshift1(u
, u
)) goto err
;
694 if (BN_GF2m_cmp(b
, a
) > 0)
696 if (!BN_GF2m_add(b
, b
, a
)) goto err
;
697 if (!BN_GF2m_add(v
, v
, u
)) goto err
;
700 if (!BN_rshift1(b
, b
)) goto err
;
701 if (BN_is_odd(v
)) if (!BN_GF2m_add(v
, v
, p
)) goto err
;
702 if (!BN_rshift1(v
, v
)) goto err
;
703 } while (!BN_is_odd(b
));
705 else if (BN_abs_is_word(a
, 1))
709 if (!BN_GF2m_add(a
, a
, b
)) goto err
;
710 if (!BN_GF2m_add(u
, u
, v
)) goto err
;
713 if (!BN_rshift1(a
, a
)) goto err
;
714 if (BN_is_odd(u
)) if (!BN_GF2m_add(u
, u
, p
)) goto err
;
715 if (!BN_rshift1(u
, u
)) goto err
;
716 } while (!BN_is_odd(a
));
720 if (!BN_copy(r
, u
)) goto err
;
730 /* Divide yy by xx, reduce modulo p, and store the result in r. r could be xx
731 * or yy, xx could equal yy.
733 * This function calls down to the BN_GF2m_mod_div implementation; this wrapper
734 * function is only provided for convenience; for best performance, use the
735 * BN_GF2m_mod_div function.
737 int BN_GF2m_mod_div_arr(BIGNUM
*r
, const BIGNUM
*yy
, const BIGNUM
*xx
, const unsigned int p
[], BN_CTX
*ctx
)
743 if ((field
= BN_CTX_get(ctx
)) == NULL
) goto err
;
744 if (!BN_GF2m_arr2poly(p
, field
)) goto err
;
746 ret
= BN_GF2m_mod_div(r
, yy
, xx
, field
, ctx
);
755 /* Compute the bth power of a, reduce modulo p, and store
756 * the result in r. r could be a.
757 * Uses simple square-and-multiply algorithm A.5.1 from IEEE P1363.
759 int BN_GF2m_mod_exp_arr(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const unsigned int p
[], BN_CTX
*ctx
)
767 if (BN_abs_is_word(b
, 1))
768 return (BN_copy(r
, a
) != NULL
);
772 if ((u
= BN_CTX_get(ctx
)) == NULL
) goto err
;
774 if (!BN_GF2m_mod_arr(u
, a
, p
)) goto err
;
776 n
= BN_num_bits(b
) - 1;
777 for (i
= n
- 1; i
>= 0; i
--)
779 if (!BN_GF2m_mod_sqr_arr(u
, u
, p
, ctx
)) goto err
;
780 if (BN_is_bit_set(b
, i
))
782 if (!BN_GF2m_mod_mul_arr(u
, u
, a
, p
, ctx
)) goto err
;
785 if (!BN_copy(r
, u
)) goto err
;
795 /* Compute the bth power of a, reduce modulo p, and store
796 * the result in r. r could be a.
798 * This function calls down to the BN_GF2m_mod_exp_arr implementation; this wrapper
799 * function is only provided for convenience; for best performance, use the
800 * BN_GF2m_mod_exp_arr function.
802 int BN_GF2m_mod_exp(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*b
, const BIGNUM
*p
, BN_CTX
*ctx
)
804 const int max
= BN_num_bits(p
);
805 unsigned int *arr
=NULL
, ret
= 0;
806 if ((arr
= (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max
)) == NULL
) goto err
;
807 ret
= BN_GF2m_poly2arr(p
, arr
, max
);
808 if (!ret
|| ret
> max
)
810 BNerr(BN_F_BN_GF2M_MOD_EXP
,BN_R_INVALID_LENGTH
);
813 ret
= BN_GF2m_mod_exp_arr(r
, a
, b
, arr
, ctx
);
816 if (arr
) OPENSSL_free(arr
);
820 /* Compute the square root of a, reduce modulo p, and store
821 * the result in r. r could be a.
822 * Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
824 int BN_GF2m_mod_sqrt_arr(BIGNUM
*r
, const BIGNUM
*a
, const unsigned int p
[], BN_CTX
*ctx
)
830 /* reduction mod 1 => return 0 */
834 if ((u
= BN_CTX_get(ctx
)) == NULL
) goto err
;
836 if (!BN_zero(u
)) goto err
;
837 if (!BN_set_bit(u
, p
[0] - 1)) goto err
;
838 ret
= BN_GF2m_mod_exp_arr(r
, a
, u
, p
, ctx
);
846 /* Compute the square root of a, reduce modulo p, and store
847 * the result in r. r could be a.
849 * This function calls down to the BN_GF2m_mod_sqrt_arr implementation; this wrapper
850 * function is only provided for convenience; for best performance, use the
851 * BN_GF2m_mod_sqrt_arr function.
853 int BN_GF2m_mod_sqrt(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
, BN_CTX
*ctx
)
855 const int max
= BN_num_bits(p
);
856 unsigned int *arr
=NULL
, ret
= 0;
857 if ((arr
= (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max
)) == NULL
) goto err
;
858 ret
= BN_GF2m_poly2arr(p
, arr
, max
);
859 if (!ret
|| ret
> max
)
861 BNerr(BN_F_BN_GF2M_MOD_EXP
,BN_R_INVALID_LENGTH
);
864 ret
= BN_GF2m_mod_sqrt_arr(r
, a
, arr
, ctx
);
867 if (arr
) OPENSSL_free(arr
);
871 /* Find r such that r^2 + r = a mod p. r could be a. If no r exists returns 0.
872 * Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
874 int BN_GF2m_mod_solve_quad_arr(BIGNUM
*r
, const BIGNUM
*a_
, const unsigned int p
[], BN_CTX
*ctx
)
876 int ret
= 0, count
= 0;
878 BIGNUM
*a
, *z
, *rho
, *w
, *w2
, *tmp
;
881 /* reduction mod 1 => return 0 */
888 if (w
== NULL
) goto err
;
890 if (!BN_GF2m_mod_arr(a
, a_
, p
)) goto err
;
898 if (p
[0] & 0x1) /* m is odd */
900 /* compute half-trace of a */
901 if (!BN_copy(z
, a
)) goto err
;
902 for (j
= 1; j
<= (p
[0] - 1) / 2; j
++)
904 if (!BN_GF2m_mod_sqr_arr(z
, z
, p
, ctx
)) goto err
;
905 if (!BN_GF2m_mod_sqr_arr(z
, z
, p
, ctx
)) goto err
;
906 if (!BN_GF2m_add(z
, z
, a
)) goto err
;
912 rho
= BN_CTX_get(ctx
);
913 w2
= BN_CTX_get(ctx
);
914 tmp
= BN_CTX_get(ctx
);
915 if (tmp
== NULL
) goto err
;
918 if (!BN_rand(rho
, p
[0], 0, 0)) goto err
;
919 if (!BN_GF2m_mod_arr(rho
, rho
, p
)) goto err
;
920 if (!BN_zero(z
)) goto err
;
921 if (!BN_copy(w
, rho
)) goto err
;
922 for (j
= 1; j
<= p
[0] - 1; j
++)
924 if (!BN_GF2m_mod_sqr_arr(z
, z
, p
, ctx
)) goto err
;
925 if (!BN_GF2m_mod_sqr_arr(w2
, w
, p
, ctx
)) goto err
;
926 if (!BN_GF2m_mod_mul_arr(tmp
, w2
, a
, p
, ctx
)) goto err
;
927 if (!BN_GF2m_add(z
, z
, tmp
)) goto err
;
928 if (!BN_GF2m_add(w
, w2
, rho
)) goto err
;
931 } while (BN_is_zero(w
) && (count
< MAX_ITERATIONS
));
934 BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD_ARR
,BN_R_TOO_MANY_ITERATIONS
);
939 if (!BN_GF2m_mod_sqr_arr(w
, z
, p
, ctx
)) goto err
;
940 if (!BN_GF2m_add(w
, z
, w
)) goto err
;
941 if (BN_GF2m_cmp(w
, a
)) goto err
;
943 if (!BN_copy(r
, z
)) goto err
;
953 /* Find r such that r^2 + r = a mod p. r could be a. If no r exists returns 0.
955 * This function calls down to the BN_GF2m_mod_solve_quad_arr implementation; this wrapper
956 * function is only provided for convenience; for best performance, use the
957 * BN_GF2m_mod_solve_quad_arr function.
959 int BN_GF2m_mod_solve_quad(BIGNUM
*r
, const BIGNUM
*a
, const BIGNUM
*p
, BN_CTX
*ctx
)
961 const int max
= BN_num_bits(p
);
962 unsigned int *arr
=NULL
, ret
= 0;
963 if ((arr
= (unsigned int *)OPENSSL_malloc(sizeof(unsigned int) * max
)) == NULL
) goto err
;
964 ret
= BN_GF2m_poly2arr(p
, arr
, max
);
965 if (!ret
|| ret
> max
)
967 BNerr(BN_F_BN_GF2M_MOD_SOLVE_QUAD
,BN_R_INVALID_LENGTH
);
970 ret
= BN_GF2m_mod_solve_quad_arr(r
, a
, arr
, ctx
);
973 if (arr
) OPENSSL_free(arr
);
977 /* Convert the bit-string representation of a polynomial
978 * ( \sum_{i=0}^n a_i * x^i , where a_0 is *not* zero) into an array
979 * of integers corresponding to the bits with non-zero coefficient.
980 * Up to max elements of the array will be filled. Return value is total
981 * number of coefficients that would be extracted if array was large enough.
983 int BN_GF2m_poly2arr(const BIGNUM
*a
, unsigned int p
[], int max
)
988 if (BN_is_zero(a
) || !BN_is_bit_set(a
, 0))
989 /* a_0 == 0 => return error (the unsigned int array
990 * must be terminated by 0)
994 for (i
= a
->top
- 1; i
>= 0; i
--)
997 /* skip word if a->d[i] == 0 */
1000 for (j
= BN_BITS2
- 1; j
>= 0; j
--)
1004 if (k
< max
) p
[k
] = BN_BITS2
* i
+ j
;
1014 /* Convert the coefficient array representation of a polynomial to a
1015 * bit-string. The array must be terminated by 0.
1017 int BN_GF2m_arr2poly(const unsigned int p
[], BIGNUM
*a
)
1022 for (i
= 0; p
[i
] != 0; i
++)
1024 BN_set_bit(a
, p
[i
]);