/* -*-c-*-
*
- * $Id: mpmont.h,v 1.5 2001/06/16 13:00:04 mdw Exp $
+ * $Id: mpmont.h,v 1.7 2004/04/01 12:50:09 mdw Exp $
*
* Montgomery reduction
*
/*----- Revision history --------------------------------------------------*
*
* $Log: mpmont.h,v $
+ * Revision 1.7 2004/04/01 12:50:09 mdw
+ * Add cyclic group abstraction, with test code. Separate off exponentation
+ * functions for better static linking. Fix a buttload of bugs on the way.
+ * Generally ensure that negative exponents do inversion correctly. Add
+ * table of standard prime-field subgroups. (Binary field subgroups are
+ * currently unimplemented but easy to add if anyone ever finds a good one.)
+ *
+ * Revision 1.6 2002/01/13 13:49:25 mdw
+ * Make @const@-correct.
+ *
* Revision 1.5 2001/06/16 13:00:04 mdw
* Moved @mpmont_factor@ to <mp.h>. Documented interface change to
* @mpmont_expr@ and @mpmont_mexpr@ -- the arguments are now in Montgomery
*
* Arguments: @mpmont *mm@ = pointer to Montgomery reduction context
* @mp *d@ = fake destination
- * @mp_expfactor *f@ = pointer to array of factors
+ * @const mp_expfactor *f@ = pointer to array of factors
* @size_t n@ = number of factors supplied
*
* Returns: If the bases are %$g_0, g_1, \ldots, g_{n-1}$% and the
*/
extern mp *mpmont_mexpr(mpmont */*mm*/, mp */*d*/,
- mp_expfactor */*f*/, size_t /*n*/);
+ const mp_expfactor */*f*/, size_t /*n*/);
/* --- @mpmont_mexp@ --- *
*
* Arguments: @mpmont *mm@ = pointer to Montgomery reduction context
* @mp *d@ = fake destination
- * @mp_expfactor *f@ = pointer to array of factors
+ * @const mp_expfactor *f@ = pointer to array of factors
* @size_t n@ = number of factors supplied
*
* Returns: Product of bases raised to exponents, all mod @m@.
*/
extern mp *mpmont_mexp(mpmont */*mm*/, mp */*d*/,
- mp_expfactor */*f*/, size_t /*n*/);
+ const mp_expfactor */*f*/, size_t /*n*/);
/*----- That's all, folks -------------------------------------------------*/