×

Elliptic curve based hardware architecture using cellular automata. (English) Zbl 1158.94385

Summary: This study presents an efficient division architecture using restricted irreducible polynomial on elliptic curve cryptosystem (ECC), based on cellular automata. The most expensive arithmetic operation in ECC is division, which is performed by multiplying the inverse of a multiplicand. The proposed architecture is highly regular, expandable, and has reduced latency and hardware complexity. The proposed architecture can be efficiently used in the hardware design of crypto-coprocessors.

MSC:

94A60 Cryptography
68Q80 Cellular automata (computational aspects)
65Y99 Computer aspects of numerical algorithms
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Choudhury, P. P.; Barua, R., Cellular automata based VLSI architecture for computing multiplication and inverses in GF \((2^m)\), (Proceedings of the IEEE 7th International Conference on VLSI Design (1994)), 279-282
[2] Diffie, W.; Hellman, M. E., New directions in cryptography, IEEE Transaction on Information Theory, IT-22, 644-654 (1976) · Zbl 0435.94018
[3] Drescher, W.; Bachmann, K.; Fettweis, G., VLSI architecture for non sequential inversion over GF \((2^m)\) using the Euclidean algorithm, (Proceedings of the International Conference on Signal Processing Applications and Technology, 2 (1997)), 1815-1819
[4] ElGamal, T., A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Trans. Inform. Theory, IT-31, 469-472 (1985) · Zbl 0571.94014
[5] Gajski, D. D., Principles of Digital Design (1997), Prentice-Hall International Inc.
[6] IEEE P1363, Standard Specifications for Public Key Cryptography, 2000.; IEEE P1363, Standard Specifications for Public Key Cryptography, 2000.
[7] 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, vol. 3157 (2004), Springer-Verlag: Springer-Verlag Berlin, pp. 241-250
[8] Kaufman, C.; Perlman, R.; Speciner, M., Network Security Private Communication in a Public World (2002), Prentice Hall: Prentice Hall New Jersey
[9] Kim, N. Y.; Yoo, K. Y., Systolic architecture for inversion/division using \(AB^2\) circuits in GF \((2^m)\), Integr. VLSI J., 35, 11-24 (2003)
[10] Koblitz, N., Elliptic curve cryptosystems, Math. Comput., 48, 203-209 (1987) · Zbl 0622.94015
[11] Menezes, A. J., Applications of Finite Fields (1993), Kluwer Academic Publishers: Kluwer Academic Publishers Boston, MA
[12] Menezes, A. J., Elliptic Curve Public Key Cryptosystems (1993), Kluwer Academic Publishers: Kluwer Academic Publishers Boston, MA · Zbl 0806.94011
[13] Miller, V. S., Use of Elliptic Curves in Cryptography (1986), Williams · Zbl 0589.94005
[14] von Neumann, J., The Theory of Self-reproducing Automata (1966), University of Illinois Press: University of Illinois Press Urbana/London
[15] Rao, T. R.N.; Fujiwara, E., Error-Control Coding for Computer Systems (1989), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ
[16] SEC 1, Elliptic Curve Cryptography version 1.0., Certicom Research, 2000.; SEC 1, Elliptic Curve Cryptography version 1.0., Certicom Research, 2000.
[17] Wang, C. L.; Guo, J. H., New systolic arrays for \(C+AB^2\), inversion, and division in GF \((2^m)\), IEEE Trans. Comp., 49, 1120-1125 (2000) · Zbl 1315.68296
[18] Wei, S. W., VLSI architecture of divider for finite field GF \((2^m)\), (Proceedings of the IEEE International Symposium on Circuit and Systems, 2 (1998)), 482-485
[19] Zhang, C. N.; Deng, M. Y.; Mason, R., A VLSI programmable cellular automata array for multiplication in GF \((2^n)\), (Proceedings of the PDPTA ’99 International Conference (1999))
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.