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 Multi-precision Binary Polynomial Arithmetic Library.
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> and
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * Douglas Stebila <douglas@stebila.ca> of Sun 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"
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersmp_err mp_badd(const mp_int *a, const mp_int *b, mp_int *c);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersmp_err mp_bmul(const mp_int *a, const mp_int *b, mp_int *c);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers/* For modular arithmetic, the irreducible polynomial f(t) is represented
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * as an array of int[], where f(t) is of the form:
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * f(t) = t^p[0] + t^p[1] + ... + t^p[k]
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers * where m = p[0] > p[1] > ... > p[k] = 0.
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersmp_err mp_bmod(const mp_int *a, const unsigned int p[], mp_int *r);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersmp_err mp_bmulmod(const mp_int *a, const mp_int *b, const unsigned int p[],
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersmp_err mp_bsqrmod(const mp_int *a, const unsigned int p[], mp_int *r);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersmp_err mp_bdivmod(const mp_int *y, const mp_int *x, const mp_int *pp,
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers const unsigned int p[], mp_int *r);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersint mp_bpoly2arr(const mp_int *a, unsigned int p[], int max);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowersmp_err mp_barr2poly(const unsigned int p[], mp_int *a);
f9fbec18f5b458b560ecf45d3db8e8bd56bf6942mcpowers#endif /* _MP_GF2M_H_ */