Article contents
Jacobi Sums, Irreducible Zeta-Polynomials, and Cryptography
Published online by Cambridge University Press: 20 November 2018
Abstract
We find conditions under which the numerator of the zeta-function of the curve y2+y = xd over Fp, where d — 2g +1 is a prime, d ≠ p, is irreducible over Q. This leads to the generalized Mersenne problem of "almost primality" of the number of points on the jacobian of such a curve over an extension of Fp, which has application to public key cryptography.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1991
References
- 4
- Cited by