f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * ***** BEGIN LICENSE BLOCK *****
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Version: MPL 1.1/GPL 2.0/LGPL 2.1
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The contents of this file are subject to the Mozilla Public License Version
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * 1.1 (the "License"); you may not use this file except in compliance with
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the License. You may obtain a copy of the License at
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Software distributed under the License is distributed on an "AS IS" basis,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * for the specific language governing rights and limitations under the
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The Original Code is the elliptic curve math library for prime field curves.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * The Initial Developer of the Original Code is
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Sun Microsystems, Inc.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Portions created by the Initial Developer are Copyright (C) 2003
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the Initial Developer. All Rights Reserved.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Contributor(s):
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Douglas Stebila <douglas@stebila.ca>, Sun Microsystems Laboratories
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Alternatively, the contents of this file may be used under the terms of
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * either the GNU General Public License Version 2 or later (the "GPL"), or
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * in which case the provisions of the GPL or the LGPL are applicable instead
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * of those above. If you wish to allow use of your version of this file only
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * under the terms of either the GPL or the LGPL, and not to allow others to
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * use your version of this file under the terms of the MPL, indicate your
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * decision by deleting the provisions above and replace them with the notice
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * and other provisions required by the GPL or the LGPL. If you do not delete
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the provisions above, a recipient may use your version of this file under
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * the terms of any one of the MPL, the GPL or the LGPL.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * ***** END LICENSE BLOCK ***** */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Copyright 2007 Sun Microsystems, Inc. All rights reserved.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Use is subject to license terms.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Sun elects to use this software under the MPL license.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers#pragma ident "%Z%%M% %I% %E% SMI"
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Fast modular reduction for p224 = 2^224 - 2^96 + 1. a can be r. Uses
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * algorithm 7 from Brown, Hankerson, Lopez, Menezes. Software
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Implementation of the NIST Elliptic Curves over Prime Fields. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersec_GFp_nistp224_mod(const mp_int *a, mp_int *r, const GFMethod *meth)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers a5a = 0, a5b = 0, a4a = 0, a4b = 0, a3a = 0, a3b = 0;
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_digit a6b = 0, a6a_a5b = 0, a5b = 0, a5a_a4b = 0, a4a_a3b = 0;
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* reduction not needed if a is not larger than field size */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers if (a == r) return MP_OKAY;
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers return mp_copy(a, r);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* for polynomials larger than twice the field size, use regular
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * reduction */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* copy out upper words of a */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* implement r = (a3a,a2,a1,a0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers +(a5a, a4,a3b, 0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers +( 0, a6,a5b, 0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers -( 0 0, 0|a6b, a6a|a5b )
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers -( a6b, a6a|a5b, a5a|a4b, a4a|a3b ) */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers while (r3b > 0) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers while (r3b < 0) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* check for final reduction */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* now the only way we are over is if the top 4 words are all ones */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers && (r2a == MP_DIGIT_MAX) && (r1b == MP_DIGIT_MAX) &&
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* one last subraction */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers if (a != r) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* set the lower words of r */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* copy out upper words of a */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* implement r = (a3a,a2,a1,a0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers +(a5a, a4,a3b, 0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers +( 0, a6,a5b, 0)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers -( 0 0, 0|a6b, a6a|a5b )
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers -( a6b, a6a|a5b, a5a|a4b, a4a|a3b ) */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* if the value is negative, r3 has a 2's complement
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * high value */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers while (r3b > 0) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers MP_ADD_CARRY(r1,((mp_digit)r3b) << 32, r1, 0, carry);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers while (r3b < 0) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers MP_ADD_CARRY (r1, MP_DIGIT_MAX <<32, r1, carry, carry);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers MP_ADD_CARRY (r3, MP_DIGIT_MAX >> 32, r3, carry, carry);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* check for final reduction */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* now the only way we are over is if the top 4 words are all ones */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers if ((r3 == (MP_DIGIT_MAX >> 32)) && (r2 == MP_DIGIT_MAX)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers && ((r1 & MP_DIGIT_MAX << 32)== MP_DIGIT_MAX << 32) &&
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* one last subraction */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers if (a != r) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* set the lower words of r */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Compute the square of polynomial a, reduce modulo p224. Store the
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * result in r. r could be a. Uses optimized modular reduction for p224.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersec_GFp_nistp224_sqr(const mp_int *a, mp_int *r, const GFMethod *meth)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Compute the product of two polynomials a and b, reduce modulo p224.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Store the result in r. r could be a or b; a could be b. Uses
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * optimized modular reduction for p224. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersec_GFp_nistp224_mul(const mp_int *a, const mp_int *b, mp_int *r,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Divides two field elements. If a is NULL, then returns the inverse of
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersec_GFp_nistp224_div(const mp_int *a, const mp_int *b, mp_int *r,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* If a is NULL, then return the inverse of b, otherwise return a/b. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers if (a == NULL) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* MPI doesn't support divmod, so we implement it using invmod and
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * mulmod. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Wire in fast field arithmetic and precomputation of base point for
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * named curves. */