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 binary polynomial 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 * Sheueling Chang-Shantz <sheueling.chang@sun.com>,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Stephen Fung <fungstep@hotmail.com>, and
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 reduction for polynomials over a 193-bit curve. Assumes reduction
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * polynomial with terms {193, 15, 0}. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersec_GF2m_193_mod(const mp_int *a, mp_int *r, const GFMethod *meth)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers if (a != r) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* u[6] only has 2 significant bits */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers u[0] ^= (z << 63);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers z = u[3] >> 1; /* z only has 63 significant bits */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers u[0] ^= (z << 15) ^ z;
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* clear bits above 193 */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* u[12] only has 2 significant bits */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers u[0] ^= (z << 31);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers z = u[6] >> 1; /* z only has 31 significant bits */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers u[0] ^= (z << 15) ^ z;
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers /* clear bits above 193 */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Fast squaring for polynomials over a 193-bit curve. Assumes reduction
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * polynomial with terms {193, 15, 0}. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersec_GF2m_193_sqr(const mp_int *a, mp_int *r, const GFMethod *meth)
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers u[0] = gf2m_SQR0(v[0]);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Fast multiplication for polynomials over a 193-bit curve. Assumes
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * reduction polynomial with terms {193, 15, 0}. */
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersec_GF2m_193_mul(const mp_int *a, const mp_int *b, mp_int *r,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_digit a3 = 0, a2 = 0, a1 = 0, a0, b3 = 0, b2 = 0, b1 = 0, b0;
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers mp_digit a6 = 0, a5 = 0, a4 = 0, b6 = 0, b5 = 0, b4 = 0;
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers if (a == b) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers switch (MP_USED(a)) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers switch (MP_USED(b)) {
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers s_bmul_4x4(MP_DIGITS(r), a3, a2, a1, a0, b3, b2, b1, b0);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers s_bmul_3x3(MP_DIGITS(r) + 8, a6, a5, a4, b6, b5, b4);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers s_bmul_4x4(MP_DIGITS(r), a3, a2, a1, a0, b3, b2, b1, b0);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers s_bmul_4x4(rm, a3, a6 ^ a2, a5 ^ a1, a4 ^ a0, b3, b6 ^ b2, b5 ^ b1,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* Wire in fast field arithmetic for 193-bit curves. */