Abstract
The performance of elliptic curve based public key cryptosystems is mainly appointed by the efficiency of the underlying finite field arithmetic. This work describes two generic and scalable architectures of finite field coprocessors, which are implemented within the latest family of Field Programmable System Level Integrated Circuits FPSLIC from Atmel, Inc. The HW architectures are adapted from Karatsuba’s divide and conquer algorithm and allow for a reasonable speedup of the top-level elliptic curve algorithms. The VHDL hardware models are automatically generated based on an eligible operand size, which permits the optimal utilization of a particular FPSLIC device.
Chapter PDF
Similar content being viewed by others
Keywords
References
R. L. Rivest, A. Shamir and L. M. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Communications of the ACM, Feb 1978.
V. Miller, “Use of elliptic curves in cryptography,” Advances in Cryptology, Proc. CRYPTO’85, LNCS 218, H. C. Williams, Ed., Springer-Verlag, pp. 417–426, 1986.
N. Koblitz, ldElliptic Curve Cryptosystems,” Mathematics of Computation, vol. 48, pp. 203–209, 1987.
A. Lenstra and E. Verheul, “Selecting Cryptographic Key Sizes,” Proc. Workshop on Practice and Theory in Public Key Cryptography, Springer-Verlag, ISBN 3540669671, pp. 446–465, 2000.
A. J. Menezes, “Elliptic Curve Public Key Cryptosystems,” Kluwer Akademic Publishers, 1993.
J. H. Silverman, “The Arithmetic of Elliptic Curves,” Graduate Texts in Mathematics, Springer-Verlag, 1986.
S. Galbraith and N. Smart, “A cryptographic application of Weil descent,” Codes and Cryptography, LNCS 1746, Springer-Verlag, pp. 191–200, 1999.
IEEE 1363, “Standard Specifications For Public Key Cryptography,” http://grouper.ieee.org/groups/1363/, 2000.
ANSI X9.62, “Public key cryptography for the financial services industry: The Elliptic Curve Digital Signature Algorithm (ECDSA),” (available from the ANSI X9 catalog), 1999.
A. Karatsuba and Y. Ofman, “Multiplication of multidigit numbers on automata,” Sov. Phys.-Dokl (Engl. transl.), vol. 7, no. 7, pp. 595–596, 1963.
D. V. Bailey and C. Paar, “Efficient Arithmetic in Finie Field Extensions with Application in Elliptic Curve Cryptography,” Journal of Cryptology, vol. 14, no. 3, pp. 153–176, 2001.
M. Ernst, S. Klupsch, O. Hauck and S. A. Huss, “Rapid Prototy** for Hardware Accelerated Elliptic Curve Public-Key Cryptosystems,” Proc. 12th IEEE Workshop on Rapid System Prototy** (RSP01), Monterey, CA, 2001.
J. L. Bentley, D. Haken and J. B. Saxe, “A general method for solving divide-andconquer recurrences,” SIGACT News, vol. 12(3), pp. 36–44, 1980.
Atmel, Inc. “Configurable Logic Data Book,” 2001.
J. Lopez and R. Dahab, “Fast multiplication on elliptic curves over GF(2m) without precomputation,” Workshop on Cryptographic Hardware and Embedded Systems (CHES 99), LNCS 1717, C. K. Koc and C. Paar Eds., Springer-Verlag, pp. 316–327, 1999.
J. Coron, “Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems,” Workshop on Cryptographic Hardware and Embedded Systems (CHES 99), LNCS 1717, C. K. Koc and C. Paar Eds., Springer-Verlag, pp. 292–302, 1999.
K. H. Leung, K. W. Ma, W. K. Wong and P. H. W. Leong, “FPGA Implementation of a Microcoded Elliptic Curve Cryptographic Processor,” Proc. IEEE FCCM 2000, pp. 68–76, Napa Valley, 2000.
S. Okada, N. Torii, K. Itoh and M. Takenaka, “Implementation of Elliptic Curve Cryptographic Coprocessor over GF(2m) on an FPGA,” Workshop on Cryptographic Hardware and Embedded Systems (CHES 2000), LNCS 1965, C. K. Koc and C. Paar Eds., Springer-Verlag, pp. 25–40, 2000.
G. Orlando and C. Paar, “A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m),” Workshop on Cryptographic Hardware and Embedded Systems (CHES 2000), LNCS 1965, C. K. Koc and C. Paar Eds., Springer-Verlag, pp. 41–56, 2000.
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
Ernst, M., Jung, M., Madlener, F., Huss, S., Blümel, R. (2003). A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over \( \mathbb{G}\mathbb{F}\left( {2^n } \right) \) . 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_28
Download citation
DOI: https://doi.org/10.1007/3-540-36400-5_28
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