*
* 2. For each divisor %$d$% of %$r - 1$% less than %$B$% (which we can
* construct using this factorization), make sure that
- * %$p^d \not\equiv 1 \pmod{r}$%.
+ * %$p^d \not\equiv 1 \pmod{r}$%.
*
* This takes a little while but not ever-so long.
*
* References:
*
* [Hitt] L. Hitt, On an improved definition of embedding degree;
- * http://eprint.iacr.org/2006/415
+ * http://eprint.iacr.org/2006/415
*
* [P1363] IEEE 1363-2000: Standard Specifications for Public Key
- * Cryptography; http://grouper.ieee.org/groups/1363/P1363/index.html
+ * Cryptography; http://grouper.ieee.org/groups/1363/P1363/index.html
*
* [SEC1] SEC 1: Elliptic Curve Cryptography;
- * http://www.secg.org/download/aid-385/sec1_final.pdf
+ * http://www.secg.org/download/aid-385/sec1_final.pdf
*/
/* --- @movcheck@ --- *
/* --- @ec_sameinfop@ --- *
*
- * Arguments: @ec_info *ei, *ej@ = two elliptic curve parameter sets
+ * Arguments: @const ec_info *ei, *ej@ = two elliptic curve parameter sets
*
* Returns: Nonzero if the curves are identical (not just isomorphic).
*
* Use: Checks for sameness of curve parameters.
*/
-int ec_sameinfop(ec_info *ei, ec_info *ej)
+int ec_sameinfop(const ec_info *ei, const ec_info *ej)
{
return (ec_samep(ei->c, ej->c) &&
MP_EQ(ei->r, ej->r) && MP_EQ(ei->h, ej->h) &&