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 * 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/* MAX_FIELD_SIZE_DIGITS is the maximum size of field element supported */ 1N/A/* the following needs to go away... */ 1N/A/* Gets the i'th bit in the binary representation of a. If i >= length(a), 1N/A * then return 0. (The above behaviour differs from mpl_get_bit, which 1N/A * causes an error if i >= length(a).) */ 1N/A * cin and cout could be the same variable. 1N/A * bin and bout could be the same variable. 1N/A * a1 or a2 and s could be the same variable. 1N/A * don't trash those outputs until their respective inputs have 1N/A /* Indicates whether the structure was constructed from dynamic memory 1N/A * or statically created. */ 1N/A /* Irreducible that defines the field. For prime fields, this is the 1N/A * prime p. For binary polynomial fields, this is the bitstring 1N/A * representation of the irreducible polynomial. */ 1N/A /* For prime fields, the value irr_arr[0] is the number of bits in the 1N/A * field. For binary polynomial fields, the irreducible polynomial 1N/A * f(t) is represented as an array of unsigned int[], where f(t) is 1N/A * of the form: f(t) = t^p[0] + t^p[1] + ... + t^p[4] where m = p[0] 1N/A * > p[1] > ... > p[4] = 0. */ 1N/A /* Field arithmetic methods. All methods (except field_enc and 1N/A * field_dec) are assumed to take field-encoded parameters and return 1N/A * field-encoded values. All methods (except field_enc and field_dec) 1N/A * are required to be implemented. */ 1N/A /* Extra storage for implementation-specific data. Any memory 1N/A * allocated to these extra fields will be cleared by extra_free. */ 1N/A/* Construct generic GFMethods. */ 1N/A/* Free the memory allocated (if any) to a GFMethod object. */ 1N/A /* Indicates whether the structure was constructed from dynamic memory 1N/A * or statically created. */ 1N/A /* Field definition and arithmetic. */ 1N/A /* Textual representation of curve name, if any. */ 1N/A /* Curve parameters, field-encoded. */ 1N/A /* x and y coordinates of the base point, field-encoded. */ 1N/A /* Order and cofactor of the base point. */ 1N/A /* Point arithmetic methods. All methods are assumed to take 1N/A * field-encoded parameters and return field-encoded values. All 1N/A * methods (except base_point_mul and points_mul) are required to be 1N/A /* Extra storage for implementation-specific data. Any memory 1N/A * allocated to these extra fields will be cleared by extra_free. */ 1N/A/* Wrapper functions for generic prime field arithmetic. */ 1N/A/* fixed length in-line adds. Count is in words */ 1N/A/* Wrapper functions for generic binary polynomial field arithmetic. */ 1N/A/* Montgomery prime field arithmetic. */ 1N/A/* point multiplication */ 1N/A/* Computes the windowed non-adjacent-form (NAF) of a scalar. Out should 1N/A * be an array of signed char's to output to, bitsize should be the number 1N/A * of bits of out, in is the original scalar, and w is the window size. 1N/A * NAF is discussed in the paper: D. Hankerson, J. Hernandez and A. 1N/A * Menezes, "Software implementation of elliptic curve cryptography over 1N/A * binary fields", Proc. CHES 2000. */ 1N/A/* Optimized field arithmetic */ 1N/A/* Optimized floating-point arithmetic */ 1N/A#
endif /* _ECL_PRIV_H */