1/*
2 * ***** BEGIN LICENSE BLOCK *****
3 * Version: MPL 1.1/GPL 2.0/LGPL 2.1
4 *
5 * The contents of this file are subject to the Mozilla Public License Version
6 * 1.1 (the "License"); you may not use this file except in compliance with
7 * the License. You may obtain a copy of the License at
8 * http://www.mozilla.org/MPL/
9 *
10 * Software distributed under the License is distributed on an "AS IS" basis,
11 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 * for the specific language governing rights and limitations under the
13 * License.
14 *
15 * The Original Code is the Multi-precision Binary Polynomial Arithmetic Library.
16 *
17 * The Initial Developer of the Original Code is
18 * Sun Microsystems, Inc.
19 * Portions created by the Initial Developer are Copyright (C) 2003
20 * the Initial Developer. All Rights Reserved.
21 *
22 * Contributor(s):
23 *   Sheueling Chang Shantz <sheueling.chang@sun.com> and
24 *   Douglas Stebila <douglas@stebila.ca> of Sun Laboratories.
25 *
26 * Alternatively, the contents of this file may be used under the terms of
27 * either the GNU General Public License Version 2 or later (the "GPL"), or
28 * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29 * in which case the provisions of the GPL or the LGPL are applicable instead
30 * of those above. If you wish to allow use of your version of this file only
31 * under the terms of either the GPL or the LGPL, and not to allow others to
32 * use your version of this file under the terms of the MPL, indicate your
33 * decision by deleting the provisions above and replace them with the notice
34 * and other provisions required by the GPL or the LGPL. If you do not delete
35 * the provisions above, a recipient may use your version of this file under
36 * the terms of any one of the MPL, the GPL or the LGPL.
37 *
38 * ***** END LICENSE BLOCK ***** */
39/*
40 * Copyright 2007 Sun Microsystems, Inc.  All rights reserved.
41 * Use is subject to license terms.
42 *
43 * Sun elects to use this software under the MPL license.
44 */
45
46#ifndef _MP_GF2M_H_
47#define _MP_GF2M_H_
48
49#pragma ident	"%Z%%M%	%I%	%E% SMI"
50
51#include "mpi.h"
52
53mp_err mp_badd(const mp_int *a, const mp_int *b, mp_int *c);
54mp_err mp_bmul(const mp_int *a, const mp_int *b, mp_int *c);
55
56/* For modular arithmetic, the irreducible polynomial f(t) is represented
57 * as an array of int[], where f(t) is of the form:
58 *     f(t) = t^p[0] + t^p[1] + ... + t^p[k]
59 * where m = p[0] > p[1] > ... > p[k] = 0.
60 */
61mp_err mp_bmod(const mp_int *a, const unsigned int p[], mp_int *r);
62mp_err mp_bmulmod(const mp_int *a, const mp_int *b, const unsigned int p[],
63    mp_int *r);
64mp_err mp_bsqrmod(const mp_int *a, const unsigned int p[], mp_int *r);
65mp_err mp_bdivmod(const mp_int *y, const mp_int *x, const mp_int *pp,
66    const unsigned int p[], mp_int *r);
67
68int mp_bpoly2arr(const mp_int *a, unsigned int p[], int max);
69mp_err mp_barr2poly(const unsigned int p[], mp_int *a);
70
71#endif /* _MP_GF2M_H_ */
72