Abstract
This study presents an efficient division architecture using irreducible trinomial in GF(2n), based on programmable cellular automata (PCA). The most expensive arithmetic operation in elliptic curve cryptosystems (ECC) is division, which is performed by multiplying the inverse of a multiplicand. The proposed architecture is highly regular, expandable, and has reduced latency. The proposed architecture can be efficiently used in the hardware design of crypto-coprocessors.
This work was supported by the Brain Korea 21 Project in 2006.
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
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)
Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)
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)
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., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 241–250. Springer, Heidelberg (2004)
Menezs, A.J.: Applications of Finite Fields. Kluwer Academic Publishers, Boston (1993)
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)
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)
Lafe, O.: Cellular Automata Transforms: Theory and Applications in Multimedia Compression, Encryption, and Modeling. Kluwer Academic Publishers, Dordrecht (2000)
Gajski, D.D.: Principles of digital design. Prentice-Hall International Inc., Englewood Cliffs (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeon, JC., Kim, KW., Oh, JB., Yoo, KY. (2006). Modular Divider for Elliptic Curve Cryptographic Hardware Based on Programmable CA. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758549_90
Download citation
DOI: https://doi.org/10.1007/11758549_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34385-1
Online ISBN: 978-3-540-34386-8
eBook Packages: Computer ScienceComputer Science (R0)