Abstract
Cellular automata (CA) have been accepted as a good evolutionary computational model for the simulation of complex physical systems. They have been used for various applications, such as parallel processing computations and number theory. In the meanwhile, elliptic curve cryptosystems (ECC) are in the spotlight owing to their significantly smaller parameters. The most costly arithmetic operation in ECC is division, which is performed by multiplying the inverse of a multiplicand. Thus, this paper presents an evolutionary hardware architecture for division based on CA over GF(2n) in ECC. The proposed architecture has the advantage of high regularity, expandability, and a reduced latency based on periodic boundary CA. The proposed architecture can be used for the hardware design of crypto-coprocessors.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)
Miller, V.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)
Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)
Rao, T.R.N., Fujiwara, E.: Error-Control Coding for Computer Systems. Prentice-Hall, Englewood Cliffs (1989)
Drescher, W., Bachmann, K., Fettweis, G.: VLSI Architecture for Non Sequential Inversion over GF(2m) using the Euclidean Algorithm. In: The International Conference on Signal Processing Applications and Technology, vol. 2, pp. 1815–1819 (1997)
Lopez, I., Dahab, R.: An overview of Elliptic Curve Cryptography. University of Campinas Press, Brazil (2000)
Von Neumann, J.: The theory of self-reproducing automata. University of Illinois Press, Urbana and London (1966)
Zhang, C.N., Deng, M.Y., Mason, R.: A VLSI Programmable Cellular Automata Array for Multiplication in GF(2n). In: PDPTA 1999 International Conference (1999)
Pal Choudhury, P., Barua, R.: Cellular Automata Based VLSI Architecture for Computing Multiplication and Inverses in GF(2m). In: IEEE 7th International Conference on VLSI Design, pp. 279–282 (1994)
Menezs, A.J.: Applications of Finite Fields. Kluwer Academic Publishers, Boston (1993)
Kaufman, C., Perlman, R., Speciner, M.: Network Security private communication in a public world. Prentice Hall, New Jersey (2002)
SEC 1: Elliptic Curve Cryptography version 1.0, Certicom Reserch (2000)
IEEE P1363, Standard Specifications for Public Key Cryptography (2000)
Wei, S.W.: VLSI architecture of divider for finite field GF(2m). In: IEEE International Symposium on Circuit and Systems, vol. 2, pp. 482–485 (1998)
Wang, C.L., Guo, J.H.: New Systolic Arrays for C+ AB2, inversion, and division in GF(2m). IEEE Trans. on Computer 49(10), 1120–1125 (2000)
Kim, N.Y., Yoo, K.Y.: Systolic architecture for inversion/division using AB2 circuits in GF(2m). Integration, the VLSI journal 35, 11–24 (2003)
Jeon, J.-C., Yoo, K.-Y.: An Evolutionary Approach to the Design of Cellular Automata Architecture for Multiplication in Elliptic Curve Cryptography over Finite Fields. In: Zhang, C., W. Guesgen, H., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 241–250. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeon, JC., Kim, KW., Yoo, KY. (2005). Evolutionary Hardware Architecture for Division in Elliptic Curve Cryptosystems over GF(2n). In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_41
Download citation
DOI: https://doi.org/10.1007/11539902_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28320-1
Online ISBN: 978-3-540-31863-7
eBook Packages: Computer ScienceComputer Science (R0)