Abstract
Cellular Automata (CA) has been used in evolutionary computation for over a decade and Elliptic Curve Cryptography (ECC) has recently received a lot of attention due to their important and practical applications in public key cryptographys. The two elliptic curve operations are the Add and Double, which are computed by field arithmetic operations, such as additions, modular multiplications, modular squarings and divisions. The addition operation for field elements is trivial and squaring is so much faster than regular multiplication. Divisions which are the important contributors for the run time also can be implemented by repeating multiplications. Thus we propose an special and efficient multiplication architecture based on CA in ECC over GF(2n). The proposed evolutionary computation architectures can be used in the effectual hardware design of coprocessor for ECC since they have high regularity and a reduced latency.
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.
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 (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)
Choudhury, P.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, 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)
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)
Fenn, S.T.J., Parker, M.G., Benaissa, M., Tayler, D.: Bit-serial multiplication in GF(2m) using irreducible all-one polynomial. IEE Proc. Comput. Digit. Tech. 144(6), 391–393 (1997)
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
Jeon, JC., Yoo, KY. (2004). 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, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-28633-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22817-2
Online ISBN: 978-3-540-28633-2
eBook Packages: Springer Book Archive