Gitiles

code.illumos.org / illumos-gate / a7fb1da4f1ff02974ca64d25c8d983fd1c1f3ccc / . / usr / src / common / mpi / mp_gf2m.h

/* | |

* ***** BEGIN LICENSE BLOCK ***** | |

* Version: MPL 1.1/GPL 2.0/LGPL 2.1 | |

* | |

* The contents of this file are subject to the Mozilla Public License Version | |

* 1.1 (the "License"); you may not use this file except in compliance with | |

* the License. You may obtain a copy of the License at | |

* http://www.mozilla.org/MPL/ | |

* | |

* Software distributed under the License is distributed on an "AS IS" basis, | |

* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License | |

* for the specific language governing rights and limitations under the | |

* License. | |

* | |

* The Original Code is the Multi-precision Binary Polynomial Arithmetic Library. | |

* | |

* The Initial Developer of the Original Code is | |

* Sun Microsystems, Inc. | |

* Portions created by the Initial Developer are Copyright (C) 2003 | |

* the Initial Developer. All Rights Reserved. | |

* | |

* Contributor(s): | |

* Sheueling Chang Shantz <sheueling.chang@sun.com> and | |

* Douglas Stebila <douglas@stebila.ca> of Sun Laboratories. | |

* | |

* Alternatively, the contents of this file may be used under the terms of | |

* either the GNU General Public License Version 2 or later (the "GPL"), or | |

* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), | |

* in which case the provisions of the GPL or the LGPL are applicable instead | |

* of those above. If you wish to allow use of your version of this file only | |

* under the terms of either the GPL or the LGPL, and not to allow others to | |

* use your version of this file under the terms of the MPL, indicate your | |

* decision by deleting the provisions above and replace them with the notice | |

* and other provisions required by the GPL or the LGPL. If you do not delete | |

* the provisions above, a recipient may use your version of this file under | |

* the terms of any one of the MPL, the GPL or the LGPL. | |

* | |

* ***** END LICENSE BLOCK ***** */ | |

/* | |

* Copyright 2007 Sun Microsystems, Inc. All rights reserved. | |

* Use is subject to license terms. | |

* | |

* Sun elects to use this software under the MPL license. | |

*/ | |

#ifndef _MP_GF2M_H_ | |

#define _MP_GF2M_H_ | |

#pragma ident "%Z%%M% %I% %E% SMI" | |

#include "mpi.h" | |

mp_err mp_badd(const mp_int *a, const mp_int *b, mp_int *c); | |

mp_err mp_bmul(const mp_int *a, const mp_int *b, mp_int *c); | |

/* For modular arithmetic, the irreducible polynomial f(t) is represented | |

* as an array of int[], where f(t) is of the form: | |

* f(t) = t^p[0] + t^p[1] + ... + t^p[k] | |

* where m = p[0] > p[1] > ... > p[k] = 0. | |

*/ | |

mp_err mp_bmod(const mp_int *a, const unsigned int p[], mp_int *r); | |

mp_err mp_bmulmod(const mp_int *a, const mp_int *b, const unsigned int p[], | |

mp_int *r); | |

mp_err mp_bsqrmod(const mp_int *a, const unsigned int p[], mp_int *r); | |

mp_err mp_bdivmod(const mp_int *y, const mp_int *x, const mp_int *pp, | |

const unsigned int p[], mp_int *r); | |

int mp_bpoly2arr(const mp_int *a, unsigned int p[], int max); | |

mp_err mp_barr2poly(const unsigned int p[], mp_int *a); | |

#endif /* _MP_GF2M_H_ */ |