Abstract
This contribution describes a new class of arithmetic architectures for Galois fields GF(2k). The main applications of the architecture are public-key systems which are based on the discrete logarithm problem for elliptic curves. The architectures use a representation of the field GF(2k) as GF((2n)m), where k = n · m. The approach explores bit parallel arithmetic in the subfield GF(2n), and serial processing for the extension field arithmetic. This mixed parallel-serial (hybrid) approach can lead to very fast implementations. The principle of these approach was initially suggested by Mastrovito. As the core module, a hybrid multiplier is introduced and several optimizations are discussed. We provide two different approaches to squaring which, in conjunction with the multiplier, yield fast exponentiation architectures.
The hybrid architectures are capable of exploring the time-space trade-off paradigm in a flexible manner. In particular, the number of clock cycles for one field multiplication, which is the atomic operation in most public-key schemes, can be reduced by a factor of n compared to all other known realizations. The acceleration is achieved at the cost of an increased computational complexity. We describe a proof-of-concept implementation of an ASIC for exponentiation in GF((2n)m), m variable.
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
W. Diffie and M. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. IT-22, pp. 644–654, 1976.
T. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Transactions on Information Theory, vol. IT-31, no. 4, pp. 469–472, 1985.
V. Miller, “Uses of elliptic curves in cryptography,” in Lecture Notes in Computer Science 218: Advances in Cryptology — CRYPTO’ 85, pp. 417–426, Springer-Verlag, Berlin, 1986.
N. Koblitz, “Hyperelliptic cryptosystems,” Journal of Cryptology, vol. 1, no. 3, pp. 129–150, 1989.
L. Adleman and J. DeMarrais, “A subexponential algorithm for discrete logarithms over all finite fields,” in Advances in Cryptography — CRYPTO’ 93, pp. 147–158, Springer-Verlag, 1993.
D. Gordon and K. McCurley, “Massively parallel computation of discrete logarithms,” in Lecture Notes in Computer Science 453: Advances in Cryptology — CRYPTO’ 92 (E. Brickell, ed.), pp. 312–323, Springer-Verlag, Berlin, August 1993.
A. Menezes, Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, 1993.
E. Mastrovito, VLSI Architectures for Computation in Galois Fields. PhD thesis, Linköping University, Dept. Electr. Eng., Linköping, Sweden, 1991.
G. Harper, A. Menezes, and S. Vanstone, “Public-key cryptosystems with very small key lengths,” in Advances in Cryptology — EUROCRYPT’ 92, pp. 163–173, May 1992.
E. D. Win, A. Bosselaers, S. Vandenberghe, P. D. Gersem, and J. Vandewalle, “A fast software implementation for arithmetic operations in GF(2n),” in Asiacrypt’ 96, Springer Lecture Notes in Computer Science, 1996.
D. Beauregard, “Efficient algorithms for implementing elliptic curve public-key schemes,” Master’s thesis, ECE Dept., Worcester Polytechnic Institute, Worcester, Massachusetts, May 1996.
E. Mastrovito, “VLSI design for multiplication over finite fields GF(2m),” in Lecture Notes in Computer Science 357, pp. 297–309, Springer-Verlag, Berlin, March 1989.
M. Hasan, M. Wang, and V. Bhargava, “Modular construction of low complexity parallel multipliers for a class of finite fields GF(2m),” IEEE Transactions on Computers, vol. 41, pp. 962–971, August 1992.
S. Fenn, M. Benaissa, and D. Taylor, “GF(2m) multiplication and division over the dual base,” IEEE Transactions on Computers, vol. 45, pp. 319–327, March 1996.
G. Feng, “A VLSI architecture for fast inversion in GF(2m),” IEEE Transactions on Computers, vol. C-38, p. 1989, Oct 1989.
M. Morii and M. Kasahara, “Efficient construction of gate circuit for computing multiplicative inverses over GF(2m),” Transactions of the IEICE, vol. E 72, pp. 37–42, January 1989.
S. Fenn, M. Benaissa, and D. Taylor, “Finite field inversion over the dual base,” IEEE Transactions on VLSI Systems, vol. 4, pp. 134–136, March 1996.
W. Geiselmann and D. Gollmann, “VLSI design for exponentiation in GF(2n),” in Lecture Notes in Computer Science 453: Advances in Cryptology — AUSCRYPT’ 90 (J. Seberry and J. Pieprzyk, eds.), (Sydney, Australia), pp. 398–405, Springer-Verlag, Berlin, January 1990.
C. Wang and D. Pei, “A VLSI design for computing exponentiation in GF(2m) and its application to generate pseudorandom number sequences,” IEEE Transactions on Computers, vol. C-39, pp. 258–262, February 1990.
M. Hasan and V. Bhargava, “Low complexity architecure for exponentiation in GF(2m),” Electronics Letters, vol. 28, pp. 1984–86, October 1992.
I. Hsu, T. Truong, L. Deutsch, and I. Reed, “A comparison of VLSI architecture of finite field multipliers using dual-, normal-, or standard bases,” IEEE Transactions on Computers, vol. 37, pp. 735–739, June 1988.
Y. Jeong and W. Burleson, “Choosing VLSI algorithms for finite field arithmetic,” in IEEE Symposium on Circuits and Systems, ISCAS 92, 1992.
C. Paar and N. Lange, “A comparative VLSI synthesis of finite field multipliers,” in 3rd International Symposium on Communication Theory and its Applications, (Lake District, UK), July 10–14 1995.
G. Agnew, R. Mullin, I. Onyschuk, and S. Vanstone, “An implementation for a fast public-key cryptosystem,” Journal of Cryptography, vol. 3, pp. 63–79, 1991.
W. Gollmann, “Algorithmenentwurf in der Kryptographie.” Habilitation, Fakultät für Informatik, Universität Karlsruhe, Germany, August 1990.
K. Yiu and K. Peterson, “A single-chip VLSI implementation of the discrete exponential public-key distribution system,” IBM Systems Journal, vol. 15, no. 1, pp. 102–116, 1982.
G. Agnew, R. Mullin, and S. Vanstone, “An implementation of elliptic curve cryptosystems over \( F_{2^{155} } \),” IEEE Journal on Selected areas in Communications, vol. 11, pp. 804–813, June 1993.
S. Lin and D. Costello, Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
N. Weste and K. Eshraghian, Principles of CMOS VLSI Design, A Systems Perspective. Addison-Wesley Publishing Company, second ed., 1992.
R. Lidl and H. Niederreiter, Finite Fields, vol. 20 of Encyclopedia of Mathematics and its Applications. Reading, Massachusetts: Addison-Wesley, 1983.
V. Afanasyev, “On the complexity of finite field arithmetic,” in 5th Joint Soviet-Swedish Intern. Workshop on Information Theory, (Moscow, USSR), pp. 9–12, January 1991.
C. Paar, “A new architecture for a parallel finite field multiplier with low complexity based on composite fields,” IEEE Transactions on Computers, vol. 45, pp. 856–861, July 1996.
W. Geiselmann, Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in Endlichen Körpern. PhD thesis, Universität Karlsruhe, Fakultät für Informatik, Institut für Algorithmen und Kognitive Systeme, Karlsruhe, Germany, 1993.
R. Mullin, I. Onyszchuk, S. Vanstone, and R. Wilson, “Optimal normal bases in GF(p n),” Discrete Applied Mathematics, North Holland, vol. 22, pp. 149–161, 1988/89.
D. Knuth, The Art of Computer Programming. Volume 2: Seminumerical Algorithms. Reading, Massachusetts: Addison-Wesley, 2nd ed., 1981.
M. Lehky, M. Nappi, and P. Soria-Rodriguez, “Coprocessor board for cryptographic applications.” Major Qualifying Project (Senior Thesis), 1996. ECE Dept., Worcester Polytechnic Institute.
A.-M. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen. PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, July 1994.
S. Paulus, Ein Algorithmus zur Berechnung der Klassengruppe quadratischer Ordnungen über Hauptidealringen. PhD thesis, Institute for Experimental Mathematics, University of Essen, Essen, Germany, June 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Paar, C., Soria-Rodriguez, P. (1997). Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m). In: Fumy, W. (eds) Advances in Cryptology — EUROCRYPT ’97. EUROCRYPT 1997. Lecture Notes in Computer Science, vol 1233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69053-0_25
Download citation
DOI: https://doi.org/10.1007/3-540-69053-0_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62975-7
Online ISBN: 978-3-540-69053-5
eBook Packages: Springer Book Archive