1N/A * ***** BEGIN LICENSE BLOCK ***** 1N/A * Version: MPL 1.1/GPL 2.0/LGPL 2.1 1N/A * The contents of this file are subject to the Mozilla Public License Version 1N/A * 1.1 (the "License"); you may not use this file except in compliance with 1N/A * the License. You may obtain a copy of the License at 1N/A * Software distributed under the License is distributed on an "AS IS" basis, 1N/A * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License 1N/A * for the specific language governing rights and limitations under the 1N/A * The Original Code is the elliptic curve math library for binary polynomial field curves. 1N/A * The Initial Developer of the Original Code is 1N/A * Sun Microsystems, Inc. 1N/A * Portions created by the Initial Developer are Copyright (C) 2003 1N/A * the Initial Developer. All Rights Reserved. 1N/A * Sheueling Chang-Shantz <sheueling.chang@sun.com>, 1N/A * Stephen Fung <fungstep@hotmail.com>, and 1N/A * Douglas Stebila <douglas@stebila.ca>, Sun Microsystems Laboratories. 1N/A * Alternatively, the contents of this file may be used under the terms of 1N/A * either the GNU General Public License Version 2 or later (the "GPL"), or 1N/A * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), 1N/A * in which case the provisions of the GPL or the LGPL are applicable instead 1N/A * of those above. If you wish to allow use of your version of this file only 1N/A * under the terms of either the GPL or the LGPL, and not to allow others to 1N/A * use your version of this file under the terms of the MPL, indicate your 1N/A * decision by deleting the provisions above and replace them with the notice 1N/A * and other provisions required by the GPL or the LGPL. If you do not delete 1N/A * the provisions above, a recipient may use your version of this file under 1N/A * the terms of any one of the MPL, the GPL or the LGPL. 1N/A * ***** END LICENSE BLOCK ***** */ 1N/A * Copyright 2007 Sun Microsystems, Inc. All rights reserved. 1N/A * Use is subject to license terms. 1N/A * Sun elects to use this software under the MPL license. 1N/A#
pragma ident "%Z%%M% %I% %E% SMI" 1N/A/* Compute the x-coordinate x/z for the point 2*(x/z) in Montgomery 1N/A * projective coordinates. Uses algorithm Mdouble in appendix of Lopez, J. 1N/A * and Dahab, R. "Fast multiplication on elliptic curves over GF(2^m) 1N/A * without precomputation". modified to not require precomputation of 1N/A * Montgomery projective coordinates. Uses algorithm Madd in appendix of 1N/A * Lopex, J. and Dahab, R. "Fast multiplication on elliptic curves over 1N/A * GF(2^m) without precomputation". */ 1N/A/* Compute the x, y affine coordinates from the point (x1, z1) (x2, z2) 1N/A * using Montgomery point multiplication algorithm Mxy() in appendix of 1N/A * Lopex, J. and Dahab, R. "Fast multiplication on elliptic curves over 1N/A * GF(2^m) without precomputation". Returns: 0 on error 1 if return value 1N/A * should be the point at infinity 2 otherwise */ 1N/A/* Computes R = nP based on algorithm 2P of Lopex, J. and Dahab, R. "Fast 1N/A * multiplication on elliptic curves over GF(2^m) without 1N/A * precomputation". Elliptic curve points P and R can be identical. Uses 1N/A * Montgomery projective coordinates. */ 1N/A /* if result should be point at infinity */ 1N/A /* find top-most bit and go one past it */ 1N/A /* if top most bit was at word break, go to next word */ 1N/A for (; i >= 0; i--) {
1N/A for (; j >= 0; j--) {
1N/A /* convert out of "projective" coordinates */ 1N/A }
else if (i ==
1) {