2
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
4
* The contents of this file are subject to the Mozilla Public License Version
5
* 1.1 (the "License"); you may not use this file except in compliance with
6
* the License. You may obtain a copy of the License at
7
* http://www.mozilla.org/MPL/
9
* Software distributed under the License is distributed on an "AS IS" basis,
10
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
11
* for the specific language governing rights and limitations under the
14
* The Original Code is the elliptic curve math library for binary polynomial
17
* The Initial Developer of the Original Code is Sun Microsystems, Inc.
18
* Portions created by Sun Microsystems, Inc. are Copyright (C) 2003
19
* Sun Microsystems, Inc. All Rights Reserved.
22
* Sheueling Chang-Shantz <sheueling.chang@sun.com>,
23
* Stephen Fung <fungstep@hotmail.com>, and
24
* Douglas Stebila <douglas@stebila.ca>, Sun Microsystems Laboratories.
26
* Alternatively, the contents of this file may be used under the terms of
27
* either the GNU General Public License Version 2 or later (the "GPL"), or
28
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29
* in which case the provisions of the GPL or the LGPL are applicable instead
30
* of those above. If you wish to allow use of your version of this file only
31
* under the terms of either the GPL or the LGPL, and not to allow others to
32
* use your version of this file under the terms of the MPL, indicate your
33
* decision by deleting the provisions above and replace them with the notice
34
* and other provisions required by the GPL or the LGPL. If you do not delete
35
* the provisions above, a recipient may use your version of this file under
36
* the terms of any one of the MPL, the GPL or the LGPL.
42
#include "mp_gf2m-priv.h"
47
/* Fast reduction for polynomials over a 233-bit curve. Assumes reduction
48
* polynomial with terms {233, 74, 0}. */
50
ec_GF2m_233_mod(const mp_int *a, mp_int *r, const GFMethod *meth)
56
MP_CHECKOK(mp_copy(a, r));
58
#ifdef ECL_SIXTY_FOUR_BIT
60
MP_CHECKOK(s_mp_pad(r, 8));
65
/* u[7] only has 18 significant bits */
67
u[4] ^= (z << 33) ^ (z >> 41);
71
u[3] ^= (z << 33) ^ (z >> 41);
75
u[2] ^= (z << 33) ^ (z >> 41);
79
u[1] ^= (z << 33) ^ (z >> 41);
81
z = u[3] >> 41; /* z only has 23 significant bits */
84
/* clear bits above 233 */
85
u[7] = u[6] = u[5] = u[4] = 0;
88
if (MP_USED(r) < 15) {
89
MP_CHECKOK(s_mp_pad(r, 15));
94
/* u[14] only has 18 significant bits */
129
z = u[7] >> 9; /* z only has 23 significant bits */
133
/* clear bits above 233 */
134
u[14] = u[13] = u[12] = u[11] = u[10] = u[9] = u[8] = 0;
143
/* Fast squaring for polynomials over a 233-bit curve. Assumes reduction
144
* polynomial with terms {233, 74, 0}. */
146
ec_GF2m_233_sqr(const mp_int *a, mp_int *r, const GFMethod *meth)
148
mp_err res = MP_OKAY;
153
#ifdef ECL_SIXTY_FOUR_BIT
154
if (MP_USED(a) < 4) {
155
return mp_bsqrmod(a, meth->irr_arr, r);
157
if (MP_USED(r) < 8) {
158
MP_CHECKOK(s_mp_pad(r, 8));
162
if (MP_USED(a) < 8) {
163
return mp_bsqrmod(a, meth->irr_arr, r);
165
if (MP_USED(r) < 15) {
166
MP_CHECKOK(s_mp_pad(r, 15));
172
#ifdef ECL_THIRTY_TWO_BIT
173
u[14] = gf2m_SQR0(v[7]);
174
u[13] = gf2m_SQR1(v[6]);
175
u[12] = gf2m_SQR0(v[6]);
176
u[11] = gf2m_SQR1(v[5]);
177
u[10] = gf2m_SQR0(v[5]);
178
u[9] = gf2m_SQR1(v[4]);
179
u[8] = gf2m_SQR0(v[4]);
181
u[7] = gf2m_SQR1(v[3]);
182
u[6] = gf2m_SQR0(v[3]);
183
u[5] = gf2m_SQR1(v[2]);
184
u[4] = gf2m_SQR0(v[2]);
185
u[3] = gf2m_SQR1(v[1]);
186
u[2] = gf2m_SQR0(v[1]);
187
u[1] = gf2m_SQR1(v[0]);
188
u[0] = gf2m_SQR0(v[0]);
189
return ec_GF2m_233_mod(r, r, meth);
195
/* Fast multiplication for polynomials over a 233-bit curve. Assumes
196
* reduction polynomial with terms {233, 74, 0}. */
198
ec_GF2m_233_mul(const mp_int *a, const mp_int *b, mp_int *r,
199
const GFMethod *meth)
201
mp_err res = MP_OKAY;
202
mp_digit a3 = 0, a2 = 0, a1 = 0, a0, b3 = 0, b2 = 0, b1 = 0, b0;
204
#ifdef ECL_THIRTY_TWO_BIT
205
mp_digit a7 = 0, a6 = 0, a5 = 0, a4 = 0, b7 = 0, b6 = 0, b5 = 0, b4 =
211
return ec_GF2m_233_sqr(a, r, meth);
213
switch (MP_USED(a)) {
214
#ifdef ECL_THIRTY_TWO_BIT
233
switch (MP_USED(b)) {
234
#ifdef ECL_THIRTY_TWO_BIT
253
#ifdef ECL_SIXTY_FOUR_BIT
254
MP_CHECKOK(s_mp_pad(r, 8));
255
s_bmul_4x4(MP_DIGITS(r), a3, a2, a1, a0, b3, b2, b1, b0);
259
MP_CHECKOK(s_mp_pad(r, 16));
260
s_bmul_4x4(MP_DIGITS(r) + 8, a7, a6, a5, a4, b7, b6, b5, b4);
261
s_bmul_4x4(MP_DIGITS(r), a3, a2, a1, a0, b3, b2, b1, b0);
262
s_bmul_4x4(rm, a7 ^ a3, a6 ^ a2, a5 ^ a1, a4 ^ a0, b7 ^ b3,
263
b6 ^ b2, b5 ^ b1, b4 ^ b0);
264
rm[7] ^= MP_DIGIT(r, 7) ^ MP_DIGIT(r, 15);
265
rm[6] ^= MP_DIGIT(r, 6) ^ MP_DIGIT(r, 14);
266
rm[5] ^= MP_DIGIT(r, 5) ^ MP_DIGIT(r, 13);
267
rm[4] ^= MP_DIGIT(r, 4) ^ MP_DIGIT(r, 12);
268
rm[3] ^= MP_DIGIT(r, 3) ^ MP_DIGIT(r, 11);
269
rm[2] ^= MP_DIGIT(r, 2) ^ MP_DIGIT(r, 10);
270
rm[1] ^= MP_DIGIT(r, 1) ^ MP_DIGIT(r, 9);
271
rm[0] ^= MP_DIGIT(r, 0) ^ MP_DIGIT(r, 8);
272
MP_DIGIT(r, 11) ^= rm[7];
273
MP_DIGIT(r, 10) ^= rm[6];
274
MP_DIGIT(r, 9) ^= rm[5];
275
MP_DIGIT(r, 8) ^= rm[4];
276
MP_DIGIT(r, 7) ^= rm[3];
277
MP_DIGIT(r, 6) ^= rm[2];
278
MP_DIGIT(r, 5) ^= rm[1];
279
MP_DIGIT(r, 4) ^= rm[0];
283
return ec_GF2m_233_mod(r, r, meth);
290
/* Wire in fast field arithmetic for 233-bit curves. */
292
ec_group_set_gf2m233(ECGroup *group, ECCurveName name)
294
group->meth->field_mod = &ec_GF2m_233_mod;
295
group->meth->field_mul = &ec_GF2m_233_mul;
296
group->meth->field_sqr = &ec_GF2m_233_sqr;