Abstract
In this article we present a low-cost coprocessor for smartcards which supports all necessary mathematical operations for a fast calculation of the Elliptic Curve Digital Signature Algorithm (ECDSA) based on the finite field GF(2m). These ECDSA operations are GF(2m) addition, 4-bit digit-serial multiplication in GF(2m), inversion in GF(2m), and inversion in GF(p). An efficient implementation of the multiplicative inversion which breaks the 11:1 limit regarding multiplications makes it possible to use affine instead of projective coordinates for point operations on elliptic curves. A bitslice architecture allows an easy adaptation for different bit lengths. A small chip area is achieved by reusing the hardware registers for different operations.
Keywords
Download to read the full chapter text
Chapter PDF
References
Menezes, A., Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004) ISBN 0-387-95273-X
Großschädl, J., Kamendje, G.: Instruction Set Extension for Fast Elliptic Curve Cryptography over Binary Finite Fields GF(2m). In: Application-Specific Systems, Architectures, and Processors—ASAP 2003, pp. 455–468. IEEE Computer Society Press, Los Alamitos (2003)
Goodman, J., Chandrakasan, A.P.: An Energy-efficient Reconfigurable Public-Key Cryptography Processor. IEEE Journal of Solid-State Circuits, 1808–1820 (November 2001)
Schroeppel, R., Beaver, C., Gonzales, R., Miller, R., Draelos, T.: A Low-Power Design for an Elliptic Curve Digital Signature Chip. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 366–380. Springer, Heidelberg (2003)
Okada, S., Torii, N., Itoh, K., Takenaka, M.: Implementation of elliptic curve cryptographic coprocessor over GF(2) on an FPGA. In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 25–40. Springer, Heidelberg (2000)
Orlando, G., Paar, C.: A High-performance Reconfigurable Elliptic Curve Processor for GF(2m). In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 41–56. Springer, Heidelberg (2000)
Gura, N., Chang Shantz, S., Eberle, H., Finchelstein, D., Gupta, S., Gupta, V., Stebila, D.: An End-to-End Systems Approach to Elliptic Curve Cryptography. In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 349–365. Springer, Heidelberg (2003)
Ernst, M., Jung, M., Madlener, F., Huss, S., Blümel, R.: A reconfigurable system on chip implementation for elliptic curve cryptography over GF(2m). In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 381–399. Springer, Heidelberg (2003)
Savaş, E., Tenca, A., Koç, Ç.: A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m). In: Paar, C., Koç, Ç.K. (eds.) CHES 2000. LNCS, vol. 1965, pp. 277–292. Springer, Heidelberg (2000)
Großschädl, J.: A Bitserial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m). In: Koç, Ç.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 206–223. Springer, Heidelberg (2001)
Wolkerstorfer, J.: Dual-Field Arithmetic Unit for GF(p) and GF(2m). In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 500–514. Springer, Heidelberg (2003)
Gutub, A., Tenca, A., Savaş, E., Koç, Ç.: Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2m). In: Kaliski Jr., B.S., Koç, Ç.K., Paar, C. (eds.) CHES 2002. LNCS, vol. 2523, pp. 484–499. Springer, Heidelberg (2003)
López, J., Dahab, R.: Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation. In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 316–327. Springer, Heidelberg (1999)
Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)
Koblitz, N.: Elliptic Curve Cryptosystems. Mathematics of Computation 48 (1987)
Brier, É., Joye, M.: Weierstraß elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, p. 335. Springer, Heidelberg (2002)
IEEE P1363, Standard Specifications for Public-Key Cryptography, IEEE standard (2000)
Infineon Technologies, Security and Chip Card ICs, SLE 66CX322P, Product Information (2002)
Berlekamp, E.R.: Algebraic Coding Theory, revised 1984 edition. Aegean Park Press (1984)
Johnson, D.B., Menezes, A.J., Vanstone, S.: The Elliptic Curve Digital Signature Algorithm (ECDSA). International Journal of Information Security 1 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aigner, H., Bock, H., Hütter, M., Wolkerstorfer, J. (2004). A Low-Cost ECC Coprocessor for Smartcards. In: Joye, M., Quisquater, JJ. (eds) Cryptographic Hardware and Embedded Systems - CHES 2004. CHES 2004. Lecture Notes in Computer Science, vol 3156. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28632-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-28632-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22666-6
Online ISBN: 978-3-540-28632-5
eBook Packages: Springer Book Archive