Hostname: page-component-cd9895bd7-jkksz Total loading time: 0 Render date: 2024-12-28T07:56:11.835Z Has data issue: false hasContentIssue false

Jacobi Sums, Irreducible Zeta-Polynomials, and Cryptography

Published online by Cambridge University Press:  20 November 2018

Neal Koblitz*
Affiliation:
Dept. of Mathematics GN-50 Univ. of Washington Seattle, WA 98195 USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Copyright
Copyright © Canadian Mathematical Society 1991

References

1. Borevich, Z. I. and Shafarevich, I. R., Number Theory, Academic Press, New York, 1966.Google Scholar
2. Gross, B. H. and Rohrlich, D. E., Some results on the Mordell-Weil group of the jacobian of the Fermät curve, Invent Math. 44 (1978), 201224.Google Scholar
3. Koblitz, N., Hyperelliptic cryptosystems, J. Cryptology 1 (1989), 139150.Google Scholar
4. Koblitz, N., A family of jacobians suitable for discrete log cryptosystems, to appear in Proc. Crypto ‘88.Google Scholar
5. Koblitz, N. and Rohrlich, D. E., Simple factors in the jacobian of a Fermät curve, Can. J. Math. 30 (1978), 11831205.Google Scholar
6. Lang, S., Algebra, 2nd ed. Addison-Wesley, Reading MA, 1984.Google Scholar
7. Lang, S., Cyclotomic Fields, Springer-Verlag, New York, 1978.Google Scholar
8. Shanks, D., Solved and Unsolved Problems in Number Theory, 3rd éd., Chelsea, New York, 1985.Google Scholar
9. Weil, A., Numbers of solutions of equations in finite fields, Bull. Amer. Math. Soc. 55 (1949), 497508.Google Scholar