2
* ***** BEGIN LICENSE BLOCK *****
3
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
5
* The contents of this file are subject to the Mozilla Public License Version
6
* 1.1 (the "License"); you may not use this file except in compliance with
7
* the License. You may obtain a copy of the License at
8
* http://www.mozilla.org/MPL/
10
* Software distributed under the License is distributed on an "AS IS" basis,
11
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12
* for the specific language governing rights and limitations under the
15
* The Original Code is the elliptic curve math library for binary polynomial field curves.
17
* The Initial Developer of the Original Code is
18
* Sun Microsystems, Inc.
19
* Portions created by the Initial Developer are Copyright (C) 2003
20
* the Initial Developer. All Rights Reserved.
23
* Sheueling Chang-Shantz <sheueling.chang@sun.com>,
24
* Stephen Fung <fungstep@hotmail.com>, and
25
* Douglas Stebila <douglas@stebila.ca>, Sun Microsystems Laboratories.
27
* Alternatively, the contents of this file may be used under the terms of
28
* either the GNU General Public License Version 2 or later (the "GPL"), or
29
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
30
* in which case the provisions of the GPL or the LGPL are applicable instead
31
* of those above. If you wish to allow use of your version of this file only
32
* under the terms of either the GPL or the LGPL, and not to allow others to
33
* use your version of this file under the terms of the MPL, indicate your
34
* decision by deleting the provisions above and replace them with the notice
35
* and other provisions required by the GPL or the LGPL. If you do not delete
36
* the provisions above, a recipient may use your version of this file under
37
* the terms of any one of the MPL, the GPL or the LGPL.
39
* ***** END LICENSE BLOCK ***** */
43
#include "mp_gf2m-priv.h"
48
/* Fast reduction for polynomials over a 193-bit curve. Assumes reduction
49
* polynomial with terms {193, 15, 0}. */
51
ec_GF2m_193_mod(const mp_int *a, mp_int *r, const GFMethod *meth)
57
MP_CHECKOK(mp_copy(a, r));
59
#ifdef ECL_SIXTY_FOUR_BIT
61
MP_CHECKOK(s_mp_pad(r, 7));
66
/* u[6] only has 2 significant bits */
68
u[3] ^= (z << 14) ^ (z >> 1);
72
u[2] ^= (z << 14) ^ (z >> 1);
76
u[1] ^= (z << 14) ^ (z >> 1);
78
z = u[3] >> 1; /* z only has 63 significant bits */
80
u[0] ^= (z << 15) ^ z;
81
/* clear bits above 193 */
82
u[6] = u[5] = u[4] = 0;
85
if (MP_USED(r) < 13) {
86
MP_CHECKOK(s_mp_pad(r, 13));
91
/* u[12] only has 2 significant bits */
93
u[6] ^= (z << 14) ^ (z >> 1);
97
u[5] ^= (z << 14) ^ (z >> 1);
101
u[4] ^= (z << 14) ^ (z >> 1);
105
u[3] ^= (z << 14) ^ (z >> 1);
109
u[2] ^= (z << 14) ^ (z >> 1);
113
u[1] ^= (z << 14) ^ (z >> 1);
115
z = u[6] >> 1; /* z only has 31 significant bits */
117
u[0] ^= (z << 15) ^ z;
118
/* clear bits above 193 */
119
u[12] = u[11] = u[10] = u[9] = u[8] = u[7] = 0;
128
/* Fast squaring for polynomials over a 193-bit curve. Assumes reduction
129
* polynomial with terms {193, 15, 0}. */
131
ec_GF2m_193_sqr(const mp_int *a, mp_int *r, const GFMethod *meth)
133
mp_err res = MP_OKAY;
138
#ifdef ECL_SIXTY_FOUR_BIT
139
if (MP_USED(a) < 4) {
140
return mp_bsqrmod(a, meth->irr_arr, r);
142
if (MP_USED(r) < 7) {
143
MP_CHECKOK(s_mp_pad(r, 7));
147
if (MP_USED(a) < 7) {
148
return mp_bsqrmod(a, meth->irr_arr, r);
150
if (MP_USED(r) < 13) {
151
MP_CHECKOK(s_mp_pad(r, 13));
157
#ifdef ECL_THIRTY_TWO_BIT
158
u[12] = gf2m_SQR0(v[6]);
159
u[11] = gf2m_SQR1(v[5]);
160
u[10] = gf2m_SQR0(v[5]);
161
u[9] = gf2m_SQR1(v[4]);
162
u[8] = gf2m_SQR0(v[4]);
163
u[7] = gf2m_SQR1(v[3]);
165
u[6] = gf2m_SQR0(v[3]);
166
u[5] = gf2m_SQR1(v[2]);
167
u[4] = gf2m_SQR0(v[2]);
168
u[3] = gf2m_SQR1(v[1]);
169
u[2] = gf2m_SQR0(v[1]);
170
u[1] = gf2m_SQR1(v[0]);
171
u[0] = gf2m_SQR0(v[0]);
172
return ec_GF2m_193_mod(r, r, meth);
178
/* Fast multiplication for polynomials over a 193-bit curve. Assumes
179
* reduction polynomial with terms {193, 15, 0}. */
181
ec_GF2m_193_mul(const mp_int *a, const mp_int *b, mp_int *r,
182
const GFMethod *meth)
184
mp_err res = MP_OKAY;
185
mp_digit a3 = 0, a2 = 0, a1 = 0, a0, b3 = 0, b2 = 0, b1 = 0, b0;
187
#ifdef ECL_THIRTY_TWO_BIT
188
mp_digit a6 = 0, a5 = 0, a4 = 0, b6 = 0, b5 = 0, b4 = 0;
193
return ec_GF2m_193_sqr(a, r, meth);
195
switch (MP_USED(a)) {
196
#ifdef ECL_THIRTY_TWO_BIT
213
switch (MP_USED(b)) {
214
#ifdef ECL_THIRTY_TWO_BIT
231
#ifdef ECL_SIXTY_FOUR_BIT
232
MP_CHECKOK(s_mp_pad(r, 8));
233
s_bmul_4x4(MP_DIGITS(r), a3, a2, a1, a0, b3, b2, b1, b0);
237
MP_CHECKOK(s_mp_pad(r, 14));
238
s_bmul_3x3(MP_DIGITS(r) + 8, a6, a5, a4, b6, b5, b4);
239
s_bmul_4x4(MP_DIGITS(r), a3, a2, a1, a0, b3, b2, b1, b0);
240
s_bmul_4x4(rm, a3, a6 ^ a2, a5 ^ a1, a4 ^ a0, b3, b6 ^ b2, b5 ^ b1,
242
rm[7] ^= MP_DIGIT(r, 7);
243
rm[6] ^= MP_DIGIT(r, 6);
244
rm[5] ^= MP_DIGIT(r, 5) ^ MP_DIGIT(r, 13);
245
rm[4] ^= MP_DIGIT(r, 4) ^ MP_DIGIT(r, 12);
246
rm[3] ^= MP_DIGIT(r, 3) ^ MP_DIGIT(r, 11);
247
rm[2] ^= MP_DIGIT(r, 2) ^ MP_DIGIT(r, 10);
248
rm[1] ^= MP_DIGIT(r, 1) ^ MP_DIGIT(r, 9);
249
rm[0] ^= MP_DIGIT(r, 0) ^ MP_DIGIT(r, 8);
250
MP_DIGIT(r, 11) ^= rm[7];
251
MP_DIGIT(r, 10) ^= rm[6];
252
MP_DIGIT(r, 9) ^= rm[5];
253
MP_DIGIT(r, 8) ^= rm[4];
254
MP_DIGIT(r, 7) ^= rm[3];
255
MP_DIGIT(r, 6) ^= rm[2];
256
MP_DIGIT(r, 5) ^= rm[1];
257
MP_DIGIT(r, 4) ^= rm[0];
261
return ec_GF2m_193_mod(r, r, meth);
268
/* Wire in fast field arithmetic for 193-bit curves. */
270
ec_group_set_gf2m193(ECGroup *group, ECCurveName name)
272
group->meth->field_mod = &ec_GF2m_193_mod;
273
group->meth->field_mul = &ec_GF2m_193_mul;
274
group->meth->field_sqr = &ec_GF2m_193_sqr;