1*c40a6cd7SToomas Soome /*
2f9fbec18Smcpowers * ***** BEGIN LICENSE BLOCK *****
3f9fbec18Smcpowers * Version: MPL 1.1/GPL 2.0/LGPL 2.1
4f9fbec18Smcpowers *
5f9fbec18Smcpowers * The contents of this file are subject to the Mozilla Public License Version
6f9fbec18Smcpowers * 1.1 (the "License"); you may not use this file except in compliance with
7f9fbec18Smcpowers * the License. You may obtain a copy of the License at
8f9fbec18Smcpowers * http://www.mozilla.org/MPL/
9f9fbec18Smcpowers *
10f9fbec18Smcpowers * Software distributed under the License is distributed on an "AS IS" basis,
11f9fbec18Smcpowers * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12f9fbec18Smcpowers * for the specific language governing rights and limitations under the
13f9fbec18Smcpowers * License.
14f9fbec18Smcpowers *
15f9fbec18Smcpowers * The Original Code is the elliptic curve math library for prime field curves.
16f9fbec18Smcpowers *
17f9fbec18Smcpowers * The Initial Developer of the Original Code is
18f9fbec18Smcpowers * Sun Microsystems, Inc.
19f9fbec18Smcpowers * Portions created by the Initial Developer are Copyright (C) 2003
20f9fbec18Smcpowers * the Initial Developer. All Rights Reserved.
21f9fbec18Smcpowers *
22f9fbec18Smcpowers * Contributor(s):
23f9fbec18Smcpowers * Stephen Fung <fungstep@hotmail.com>, Sun Microsystems Laboratories
24f9fbec18Smcpowers *
25f9fbec18Smcpowers * Alternatively, the contents of this file may be used under the terms of
26f9fbec18Smcpowers * either the GNU General Public License Version 2 or later (the "GPL"), or
27f9fbec18Smcpowers * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28f9fbec18Smcpowers * in which case the provisions of the GPL or the LGPL are applicable instead
29f9fbec18Smcpowers * of those above. If you wish to allow use of your version of this file only
30f9fbec18Smcpowers * under the terms of either the GPL or the LGPL, and not to allow others to
31f9fbec18Smcpowers * use your version of this file under the terms of the MPL, indicate your
32f9fbec18Smcpowers * decision by deleting the provisions above and replace them with the notice
33f9fbec18Smcpowers * and other provisions required by the GPL or the LGPL. If you do not delete
34f9fbec18Smcpowers * the provisions above, a recipient may use your version of this file under
35f9fbec18Smcpowers * the terms of any one of the MPL, the GPL or the LGPL.
36f9fbec18Smcpowers *
37f9fbec18Smcpowers * ***** END LICENSE BLOCK ***** */
38f9fbec18Smcpowers /*
39f9fbec18Smcpowers * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
40f9fbec18Smcpowers * Use is subject to license terms.
41f9fbec18Smcpowers *
42f9fbec18Smcpowers * Sun elects to use this software under the MPL license.
43f9fbec18Smcpowers */
44f9fbec18Smcpowers
45f9fbec18Smcpowers #include "ecp.h"
46f9fbec18Smcpowers #include "ecl-priv.h"
47f9fbec18Smcpowers #include "mplogic.h"
48f9fbec18Smcpowers #ifndef _KERNEL
49f9fbec18Smcpowers #include <stdlib.h>
50f9fbec18Smcpowers #endif
51f9fbec18Smcpowers
52f9fbec18Smcpowers #define MAX_SCRATCH 6
53f9fbec18Smcpowers
54*c40a6cd7SToomas Soome /* Computes R = 2P. Elliptic curve points P and R can be identical. Uses
55f9fbec18Smcpowers * Modified Jacobian coordinates.
56f9fbec18Smcpowers *
57*c40a6cd7SToomas Soome * Assumes input is already field-encoded using field_enc, and returns
58f9fbec18Smcpowers * output that is still field-encoded.
59f9fbec18Smcpowers *
60f9fbec18Smcpowers */
61f9fbec18Smcpowers mp_err
ec_GFp_pt_dbl_jm(const mp_int * px,const mp_int * py,const mp_int * pz,const mp_int * paz4,mp_int * rx,mp_int * ry,mp_int * rz,mp_int * raz4,mp_int scratch[],const ECGroup * group)62f9fbec18Smcpowers ec_GFp_pt_dbl_jm(const mp_int *px, const mp_int *py, const mp_int *pz,
63f9fbec18Smcpowers const mp_int *paz4, mp_int *rx, mp_int *ry, mp_int *rz,
64f9fbec18Smcpowers mp_int *raz4, mp_int scratch[], const ECGroup *group)
65f9fbec18Smcpowers {
66f9fbec18Smcpowers mp_err res = MP_OKAY;
67f9fbec18Smcpowers mp_int *t0, *t1, *M, *S;
68f9fbec18Smcpowers
69f9fbec18Smcpowers t0 = &scratch[0];
70f9fbec18Smcpowers t1 = &scratch[1];
71f9fbec18Smcpowers M = &scratch[2];
72f9fbec18Smcpowers S = &scratch[3];
73f9fbec18Smcpowers
74f9fbec18Smcpowers #if MAX_SCRATCH < 4
75f9fbec18Smcpowers #error "Scratch array defined too small "
76f9fbec18Smcpowers #endif
77f9fbec18Smcpowers
78f9fbec18Smcpowers /* Check for point at infinity */
79f9fbec18Smcpowers if (ec_GFp_pt_is_inf_jac(px, py, pz) == MP_YES) {
80f9fbec18Smcpowers /* Set r = pt at infinity by setting rz = 0 */
81f9fbec18Smcpowers
82f9fbec18Smcpowers MP_CHECKOK(ec_GFp_pt_set_inf_jac(rx, ry, rz));
83f9fbec18Smcpowers goto CLEANUP;
84f9fbec18Smcpowers }
85f9fbec18Smcpowers
86f9fbec18Smcpowers /* M = 3 (px^2) + a*(pz^4) */
87f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(px, t0, group->meth));
88f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(t0, t0, M, group->meth));
89f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(t0, M, t0, group->meth));
90f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(t0, paz4, M, group->meth));
91f9fbec18Smcpowers
92f9fbec18Smcpowers /* rz = 2 * py * pz */
93f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(py, pz, S, group->meth));
94f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(S, S, rz, group->meth));
95f9fbec18Smcpowers
96f9fbec18Smcpowers /* t0 = 2y^2 , t1 = 8y^4 */
97f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(py, t0, group->meth));
98f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(t0, t0, t0, group->meth));
99f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(t0, t1, group->meth));
100f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(t1, t1, t1, group->meth));
101f9fbec18Smcpowers
102f9fbec18Smcpowers /* S = 4 * px * py^2 = 2 * px * t0 */
103f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(px, t0, S, group->meth));
104f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(S, S, S, group->meth));
105f9fbec18Smcpowers
106f9fbec18Smcpowers
107f9fbec18Smcpowers /* rx = M^2 - 2S */
108f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(M, rx, group->meth));
109f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(rx, S, rx, group->meth));
110f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(rx, S, rx, group->meth));
111f9fbec18Smcpowers
112f9fbec18Smcpowers /* ry = M * (S - rx) - t1 */
113f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(S, rx, S, group->meth));
114f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(S, M, ry, group->meth));
115f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(ry, t1, ry, group->meth));
116f9fbec18Smcpowers
117f9fbec18Smcpowers /* ra*z^4 = 2*t1*(apz4) */
118f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(paz4, t1, raz4, group->meth));
119f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(raz4, raz4, raz4, group->meth));
120f9fbec18Smcpowers
121f9fbec18Smcpowers
122f9fbec18Smcpowers CLEANUP:
123f9fbec18Smcpowers return res;
124f9fbec18Smcpowers }
125f9fbec18Smcpowers
126f9fbec18Smcpowers /* Computes R = P + Q where R is (rx, ry, rz), P is (px, py, pz) and Q is
127f9fbec18Smcpowers * (qx, qy, 1). Elliptic curve points P, Q, and R can all be identical.
128f9fbec18Smcpowers * Uses mixed Modified_Jacobian-affine coordinates. Assumes input is
129f9fbec18Smcpowers * already field-encoded using field_enc, and returns output that is still
130f9fbec18Smcpowers * field-encoded. */
131f9fbec18Smcpowers mp_err
ec_GFp_pt_add_jm_aff(const mp_int * px,const mp_int * py,const mp_int * pz,const mp_int * paz4,const mp_int * qx,const mp_int * qy,mp_int * rx,mp_int * ry,mp_int * rz,mp_int * raz4,mp_int scratch[],const ECGroup * group)132f9fbec18Smcpowers ec_GFp_pt_add_jm_aff(const mp_int *px, const mp_int *py, const mp_int *pz,
133f9fbec18Smcpowers const mp_int *paz4, const mp_int *qx,
134f9fbec18Smcpowers const mp_int *qy, mp_int *rx, mp_int *ry, mp_int *rz,
135f9fbec18Smcpowers mp_int *raz4, mp_int scratch[], const ECGroup *group)
136f9fbec18Smcpowers {
137f9fbec18Smcpowers mp_err res = MP_OKAY;
138f9fbec18Smcpowers mp_int *A, *B, *C, *D, *C2, *C3;
139f9fbec18Smcpowers
140f9fbec18Smcpowers A = &scratch[0];
141f9fbec18Smcpowers B = &scratch[1];
142f9fbec18Smcpowers C = &scratch[2];
143f9fbec18Smcpowers D = &scratch[3];
144f9fbec18Smcpowers C2 = &scratch[4];
145f9fbec18Smcpowers C3 = &scratch[5];
146f9fbec18Smcpowers
147f9fbec18Smcpowers #if MAX_SCRATCH < 6
148f9fbec18Smcpowers #error "Scratch array defined too small "
149f9fbec18Smcpowers #endif
150f9fbec18Smcpowers
151f9fbec18Smcpowers /* If either P or Q is the point at infinity, then return the other
152f9fbec18Smcpowers * point */
153f9fbec18Smcpowers if (ec_GFp_pt_is_inf_jac(px, py, pz) == MP_YES) {
154f9fbec18Smcpowers MP_CHECKOK(ec_GFp_pt_aff2jac(qx, qy, rx, ry, rz, group));
155f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(rz, raz4, group->meth));
156f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(raz4, raz4, group->meth));
157f9fbec18Smcpowers MP_CHECKOK(group->meth->
158f9fbec18Smcpowers field_mul(raz4, &group->curvea, raz4, group->meth));
159f9fbec18Smcpowers goto CLEANUP;
160f9fbec18Smcpowers }
161f9fbec18Smcpowers if (ec_GFp_pt_is_inf_aff(qx, qy) == MP_YES) {
162f9fbec18Smcpowers MP_CHECKOK(mp_copy(px, rx));
163f9fbec18Smcpowers MP_CHECKOK(mp_copy(py, ry));
164f9fbec18Smcpowers MP_CHECKOK(mp_copy(pz, rz));
165f9fbec18Smcpowers MP_CHECKOK(mp_copy(paz4, raz4));
166f9fbec18Smcpowers goto CLEANUP;
167f9fbec18Smcpowers }
168f9fbec18Smcpowers
169f9fbec18Smcpowers /* A = qx * pz^2, B = qy * pz^3 */
170f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(pz, A, group->meth));
171f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(A, pz, B, group->meth));
172f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(A, qx, A, group->meth));
173f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(B, qy, B, group->meth));
174f9fbec18Smcpowers
175f9fbec18Smcpowers /* C = A - px, D = B - py */
176f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(A, px, C, group->meth));
177f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(B, py, D, group->meth));
178f9fbec18Smcpowers
179f9fbec18Smcpowers /* C2 = C^2, C3 = C^3 */
180f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(C, C2, group->meth));
181f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(C, C2, C3, group->meth));
182f9fbec18Smcpowers
183f9fbec18Smcpowers /* rz = pz * C */
184f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(pz, C, rz, group->meth));
185f9fbec18Smcpowers
186f9fbec18Smcpowers /* C = px * C^2 */
187f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(px, C2, C, group->meth));
188f9fbec18Smcpowers /* A = D^2 */
189f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(D, A, group->meth));
190f9fbec18Smcpowers
191f9fbec18Smcpowers /* rx = D^2 - (C^3 + 2 * (px * C^2)) */
192f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(C, C, rx, group->meth));
193f9fbec18Smcpowers MP_CHECKOK(group->meth->field_add(C3, rx, rx, group->meth));
194f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(A, rx, rx, group->meth));
195f9fbec18Smcpowers
196f9fbec18Smcpowers /* C3 = py * C^3 */
197f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(py, C3, C3, group->meth));
198f9fbec18Smcpowers
199f9fbec18Smcpowers /* ry = D * (px * C^2 - rx) - py * C^3 */
200f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(C, rx, ry, group->meth));
201f9fbec18Smcpowers MP_CHECKOK(group->meth->field_mul(D, ry, ry, group->meth));
202f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sub(ry, C3, ry, group->meth));
203f9fbec18Smcpowers
204f9fbec18Smcpowers /* raz4 = a * rz^4 */
205f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(rz, raz4, group->meth));
206f9fbec18Smcpowers MP_CHECKOK(group->meth->field_sqr(raz4, raz4, group->meth));
207f9fbec18Smcpowers MP_CHECKOK(group->meth->
208f9fbec18Smcpowers field_mul(raz4, &group->curvea, raz4, group->meth));
209f9fbec18Smcpowers CLEANUP:
210f9fbec18Smcpowers return res;
211f9fbec18Smcpowers }
212f9fbec18Smcpowers
213f9fbec18Smcpowers /* Computes R = nP where R is (rx, ry) and P is the base point. Elliptic
214f9fbec18Smcpowers * curve points P and R can be identical. Uses mixed Modified-Jacobian
215f9fbec18Smcpowers * co-ordinates for doubling and Chudnovsky Jacobian coordinates for
216f9fbec18Smcpowers * additions. Assumes input is already field-encoded using field_enc, and
217f9fbec18Smcpowers * returns output that is still field-encoded. Uses 5-bit window NAF
218f9fbec18Smcpowers * method (algorithm 11) for scalar-point multiplication from Brown,
219*c40a6cd7SToomas Soome * Hankerson, Lopez, Menezes. Software Implementation of the NIST Elliptic
220f9fbec18Smcpowers * Curves Over Prime Fields. */
221f9fbec18Smcpowers mp_err
ec_GFp_pt_mul_jm_wNAF(const mp_int * n,const mp_int * px,const mp_int * py,mp_int * rx,mp_int * ry,const ECGroup * group)222f9fbec18Smcpowers ec_GFp_pt_mul_jm_wNAF(const mp_int *n, const mp_int *px, const mp_int *py,
223f9fbec18Smcpowers mp_int *rx, mp_int *ry, const ECGroup *group)
224f9fbec18Smcpowers {
225f9fbec18Smcpowers mp_err res = MP_OKAY;
226f9fbec18Smcpowers mp_int precomp[16][2], rz, tpx, tpy;
227f9fbec18Smcpowers mp_int raz4;
228f9fbec18Smcpowers mp_int scratch[MAX_SCRATCH];
229f9fbec18Smcpowers signed char *naf = NULL;
230f9fbec18Smcpowers int i, orderBitSize;
231f9fbec18Smcpowers
232f9fbec18Smcpowers MP_DIGITS(&rz) = 0;
233f9fbec18Smcpowers MP_DIGITS(&raz4) = 0;
234f9fbec18Smcpowers MP_DIGITS(&tpx) = 0;
235f9fbec18Smcpowers MP_DIGITS(&tpy) = 0;
236f9fbec18Smcpowers for (i = 0; i < 16; i++) {
237f9fbec18Smcpowers MP_DIGITS(&precomp[i][0]) = 0;
238f9fbec18Smcpowers MP_DIGITS(&precomp[i][1]) = 0;
239f9fbec18Smcpowers }
240f9fbec18Smcpowers for (i = 0; i < MAX_SCRATCH; i++) {
241f9fbec18Smcpowers MP_DIGITS(&scratch[i]) = 0;
242f9fbec18Smcpowers }
243f9fbec18Smcpowers
244f9fbec18Smcpowers ARGCHK(group != NULL, MP_BADARG);
245f9fbec18Smcpowers ARGCHK((n != NULL) && (px != NULL) && (py != NULL), MP_BADARG);
246f9fbec18Smcpowers
247f9fbec18Smcpowers /* initialize precomputation table */
248f9fbec18Smcpowers MP_CHECKOK(mp_init(&tpx, FLAG(n)));
249f9fbec18Smcpowers MP_CHECKOK(mp_init(&tpy, FLAG(n)));;
250f9fbec18Smcpowers MP_CHECKOK(mp_init(&rz, FLAG(n)));
251f9fbec18Smcpowers MP_CHECKOK(mp_init(&raz4, FLAG(n)));
252f9fbec18Smcpowers
253f9fbec18Smcpowers for (i = 0; i < 16; i++) {
254f9fbec18Smcpowers MP_CHECKOK(mp_init(&precomp[i][0], FLAG(n)));
255f9fbec18Smcpowers MP_CHECKOK(mp_init(&precomp[i][1], FLAG(n)));
256f9fbec18Smcpowers }
257f9fbec18Smcpowers for (i = 0; i < MAX_SCRATCH; i++) {
258f9fbec18Smcpowers MP_CHECKOK(mp_init(&scratch[i], FLAG(n)));
259f9fbec18Smcpowers }
260f9fbec18Smcpowers
261f9fbec18Smcpowers /* Set out[8] = P */
262f9fbec18Smcpowers MP_CHECKOK(mp_copy(px, &precomp[8][0]));
263f9fbec18Smcpowers MP_CHECKOK(mp_copy(py, &precomp[8][1]));
264f9fbec18Smcpowers
265f9fbec18Smcpowers /* Set (tpx, tpy) = 2P */
266f9fbec18Smcpowers MP_CHECKOK(group->
267f9fbec18Smcpowers point_dbl(&precomp[8][0], &precomp[8][1], &tpx, &tpy,
268f9fbec18Smcpowers group));
269f9fbec18Smcpowers
270f9fbec18Smcpowers /* Set 3P, 5P, ..., 15P */
271f9fbec18Smcpowers for (i = 8; i < 15; i++) {
272f9fbec18Smcpowers MP_CHECKOK(group->
273f9fbec18Smcpowers point_add(&precomp[i][0], &precomp[i][1], &tpx, &tpy,
274f9fbec18Smcpowers &precomp[i + 1][0], &precomp[i + 1][1],
275f9fbec18Smcpowers group));
276f9fbec18Smcpowers }
277f9fbec18Smcpowers
278f9fbec18Smcpowers /* Set -15P, -13P, ..., -P */
279f9fbec18Smcpowers for (i = 0; i < 8; i++) {
280f9fbec18Smcpowers MP_CHECKOK(mp_copy(&precomp[15 - i][0], &precomp[i][0]));
281f9fbec18Smcpowers MP_CHECKOK(group->meth->
282f9fbec18Smcpowers field_neg(&precomp[15 - i][1], &precomp[i][1],
283f9fbec18Smcpowers group->meth));
284f9fbec18Smcpowers }
285f9fbec18Smcpowers
286f9fbec18Smcpowers /* R = inf */
287f9fbec18Smcpowers MP_CHECKOK(ec_GFp_pt_set_inf_jac(rx, ry, &rz));
288f9fbec18Smcpowers
289f9fbec18Smcpowers orderBitSize = mpl_significant_bits(&group->order);
290f9fbec18Smcpowers
291f9fbec18Smcpowers /* Allocate memory for NAF */
292f9fbec18Smcpowers #ifdef _KERNEL
293f9fbec18Smcpowers naf = (signed char *) kmem_alloc((orderBitSize + 1), FLAG(n));
294f9fbec18Smcpowers #else
295f9fbec18Smcpowers naf = (signed char *) malloc(sizeof(signed char) * (orderBitSize + 1));
296f9fbec18Smcpowers if (naf == NULL) {
297f9fbec18Smcpowers res = MP_MEM;
298f9fbec18Smcpowers goto CLEANUP;
299f9fbec18Smcpowers }
300f9fbec18Smcpowers #endif
301f9fbec18Smcpowers
302f9fbec18Smcpowers /* Compute 5NAF */
303f9fbec18Smcpowers ec_compute_wNAF(naf, orderBitSize, n, 5);
304f9fbec18Smcpowers
305f9fbec18Smcpowers /* wNAF method */
306f9fbec18Smcpowers for (i = orderBitSize; i >= 0; i--) {
307f9fbec18Smcpowers /* R = 2R */
308*c40a6cd7SToomas Soome ec_GFp_pt_dbl_jm(rx, ry, &rz, &raz4, rx, ry, &rz,
309f9fbec18Smcpowers &raz4, scratch, group);
310f9fbec18Smcpowers if (naf[i] != 0) {
311f9fbec18Smcpowers ec_GFp_pt_add_jm_aff(rx, ry, &rz, &raz4,
312f9fbec18Smcpowers &precomp[(naf[i] + 15) / 2][0],
313f9fbec18Smcpowers &precomp[(naf[i] + 15) / 2][1], rx, ry,
314f9fbec18Smcpowers &rz, &raz4, scratch, group);
315f9fbec18Smcpowers }
316f9fbec18Smcpowers }
317f9fbec18Smcpowers
318f9fbec18Smcpowers /* convert result S to affine coordinates */
319f9fbec18Smcpowers MP_CHECKOK(ec_GFp_pt_jac2aff(rx, ry, &rz, rx, ry, group));
320f9fbec18Smcpowers
321f9fbec18Smcpowers CLEANUP:
322f9fbec18Smcpowers for (i = 0; i < MAX_SCRATCH; i++) {
323f9fbec18Smcpowers mp_clear(&scratch[i]);
324f9fbec18Smcpowers }
325f9fbec18Smcpowers for (i = 0; i < 16; i++) {
326f9fbec18Smcpowers mp_clear(&precomp[i][0]);
327f9fbec18Smcpowers mp_clear(&precomp[i][1]);
328f9fbec18Smcpowers }
329f9fbec18Smcpowers mp_clear(&tpx);
330f9fbec18Smcpowers mp_clear(&tpy);
331f9fbec18Smcpowers mp_clear(&rz);
332f9fbec18Smcpowers mp_clear(&raz4);
333f9fbec18Smcpowers #ifdef _KERNEL
334f9fbec18Smcpowers kmem_free(naf, (orderBitSize + 1));
335f9fbec18Smcpowers #else
336f9fbec18Smcpowers free(naf);
337f9fbec18Smcpowers #endif
338f9fbec18Smcpowers return res;
339f9fbec18Smcpowers }
340