Abstract
Hyperelliptic curve cryptography with genus larger than one has not been seriously considered for cryptographic purposes because many existing implementations are significantly slower than elliptic curve versions with the same level of security. In this paper, the first ever complete hardware implementation of a hyperelliptic curve coprocessor is described. This coprocessor is designed for genus two curves over \( \mathbb{F}_{2^{113} } \) . Additionally, a modification to the Extended Euclidean Algorithm is presented for the GCD calculation required by Cantor’s algorithm. On average, this new method computes the GCD in one-fourth the time required by the Extended Euclidean Algorithm.
Research supported by NSF EIA 00-88063
Chapter PDF
References
D. Bertsekas, R. Gallager. Data Networks. Prentice Hall: New Jersey. 1992.
I. Blake, G. Seroussi, N. Smart. Elliptic Curves in Cryptography. London Mathematical Society Lecture Notes Series, Volume 265. University Press: Cambridge. 1999.
D. Cantor. “Computing the Jacobian of a Hyperelliptic Curve.” Mathematics of Computation, v 48, pp 95–101. January 1987.
T. Clancy, Y. Liow. “FPGA-based Hyperelliptic Curve Cryptosystems.” to appear.
D. Dummit, R. Foote. Abstract Algebra. John Wiley and Sons: New York. 1999.
D. Hankerson, J. Hernandez, A. Menezes. “Software Implementation of Elliptic Curve Cryptosystems Over Binary Fields.” CHES 2000, LNCS, Volume 1965, pp 1–24. Springer-Verlag: New York. 2000.
T. Hungerford. Algebra. Graduate Texts in Mathematics, Volume 73. Springer-Verlag: New York. 1974.
C. Gunther, T. Lange, A. Stein. “Speeding up the Arithmetic on Koblitz Curves of Genus Two.” SAC 2000, LNCS, Volume 2012, pp 106–117. Springer-Verlag: New York. 2001.
L. Kleinrock. Queueing Systems, Volume I: Theory. John Wiley and Sons: New York. 1975.
N. Koblitz. “A Family of Jacobians Suitible for Discrete Log Cryptosystems.” CRYPTO 1988, LNCS, Voume 403, pp 94–99. Springer-Verlag: New York. 1988.
N. Koblitz. “Hyperelliptic Cryptosystems.” Journal of Cryptology, Volume 1, pp 139–150. 1989.
N. Koblitz. Algebraic Aspects of Cryptography. Algorithms and Computation in Mathematics, Volume 3. Springer: New York. 1998.
T. Lange. “Fast Arithmetic on Hyperelliptic Curves.” PhD Thesis, Institute for Information Security and Cryptography, Ruhr-Universität Bochum. 2002.
A. Menezes, P. van Oorschot, S. Vanstone. Handbook of Applied Cryptography. CRC Press. 1997.
A. Menezes, Y. Wu, R. Zuccherato. “An Elementary Introduction to Hyperelliptic Curves.” appendix in Algebraic Aspects of Cryptography N. Koblitz, Springer-Verlag, 1998.
G. Orlando, C. Paar. “A High Performance Reconfigurable Elliptic Curve Processor for GF(2m).” CHES 2000, LNCS, Volume 1965, pp 41–56. Springer-Verlag: New York. 2000.
J. Silverman. Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, Volume 106. Springer-Verlag: New York. 1986.
N. Smart. “On the Performance of Hyperelliptic Cryptosystems.” HPL-98-162. HP Extended Enterprise Laboratory. September 1998.
L. Song, K. Parhi, “Low-Energy Digit-Serial/Parallel Finite Field Multipliers,” Journal of VHDL Signal Processing Systems. pp 1–17. 1997.
T. Wollinger. “Computer Architectures for Cryptosystems Based on Hyperelliptic Curves.” Master’s Thesis, Worcester Polytechnic Institute. April 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boston, N., Clancy, T., Liow, Y., Webster, J. (2003). Genus Two Hyperelliptic Curve Coprocessor. In: Kaliski, B.S., Koç, ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems - CHES 2002. CHES 2002. Lecture Notes in Computer Science, vol 2523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36400-5_29
Download citation
DOI: https://doi.org/10.1007/3-540-36400-5_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00409-7
Online ISBN: 978-3-540-36400-9
eBook Packages: Springer Book Archive