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. 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 * 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 * code implementation. */ 1N/A/* Construct a generic GFMethod for arithmetic over prime fields with 1N/A * irreducible irr. */ 1N/A/* Wrapper functions for generic prime field arithmetic. */ 1N/A/* Field multiplication using Montgomery reduction. */ 1N/A /* if MP_MONT_USE_MP_MUL is defined, then the function s_mp_mul_mont 1N/A * is not implemented and we have to use mp_mul and s_mp_redc directly 1N/A /* s_mp_mul_mont doesn't allow source and destination to be the same */ 1N/A if ((a == r) || (b == r)) {
1N/A/* Field squaring using Montgomery reduction. */ 1N/A/* Field division using Montgomery reduction. */ 1N/A /* if A=aZ represents a encoded in montgomery coordinates with Z and # 1N/A * and \ respectively represent multiplication and division in 1N/A * montgomery coordinates, then A\B = (a/b)Z = (A/B)Z and Binv = 1N/A * (1/b)Z = (1/B)(Z^2) where B # Binv = Z */ 1N/A/* Encode a field element in Montgomery form. See s_mp_to_mont in 1N/A/* Decode a field element from Montgomery form. */ 1N/A/* Free the memory allocated to the extra fields of Montgomery GFMethod