Abstract
We investigate the jacobians of the hyperelliptic curves v2+ v = u2g+1 over finite fields, and discuss which are likely to have “almost prime” order.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
L. M. Adleman and Ming-Deh A. Huang, “Recognizing primes in random polynomial time,” preprint.
D. Cantor, “Computing in the jacobian of a hyperelliptic curve,” Math. of Computation, 48 (1987), 95–101.
N. Koblitz, A Course in Number Theory and Cryptography, Springer-Verlag, New York, 1987.
N. Koblitz, “Elliptic curve cryptosystems,” Math. of Computation, 48 (1987), 203–209.
N. Koblitz, “Primality of the number of points on an elliptic curve over a finite field,” Pacific J. Math., 131 (1988), 157–165.
N. Koblitz, “Hyperelliptic cryptosystems,” to appear.
N. Koblitz and D. Rohrlich, “Simple factors in the jacobian of a Fermat curve,” Can. J. Math., 30 (1978), 1183–1205.
H. W. Lenstra, Jr., “Factoring integers with elliptic curves,” Report 86-18, Mathematisch Instituut, Universiteit van Amsterdam, 1986.
V. Miller, “Use of elliptic curves in cryptography,” Advances in Cryptology — Crypto’ 85, Springer-Verlag, New York, 1986, 417–426.
A. M. Odlyzko, “Discrete logarithms and their cryptographic significance,” Advances in Cryptography: Proceedings of Eurocrypt 84, Springer-Verlag, New York, 1985, 224–314.
D. Shanks, Solved and Unsolved Problems in Number Theory, 3rd ed., Chelsea, New York, 1985.
S. S. Wagstaff, Jr., “Divisors of Mersenne Numbers,” Math. of Computation, 40 (1983), 385–397.
A. Weil, “Numbers of solutions of equations in finite fields,” Bull. Amer. Math. Soc., 55 (1949), 497–508.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koblitz, N. (1990). A Family of Jacobians Suitable for Discrete Log Cryptosystems. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_8
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive