Abstract
This paper proposes two new multipliers based on cellular automata over finite field. Finite fields arithmetic operations have been widely used in the areas of data communication and network security applications. First, a multiplier with generalized irreducible polynomial is implemented with MSB-first fashion. Then, new algorithm and architecture are proposed to reduce the size of the first multiplier. The algorithm and architecture uses the property of irreducible all one polynomial as a modulus. Since the proposed architectures have regularity, modularity and concurrency, they are suitable for VLSI implementation and could be used in IC cards because they have particularly simple architecture. They can be used as a basic architecture for the public-key cryptosystems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Reed, I.S., Truong, T.K.: The use of finite fields to compute convolutions. IEEE Trans. on Information Theory IT-21, 208–213 (1975)
Schneier, B.: Applied Cryptography, 2nd edn. John Wiley and Sons, Inc., Chichester (1996)
Neumann, V.: The theory of self-reproducing automata. Univ. of Illinois Press, Urbana (1966)
Wolfram, S.: Statistical mechanics of cellular automata. Rev. of Modern Physics. 55, 601–644 (1983)
Pries, W., Thanailakis, A., Card, H.C.: Group properties of cellular automata and VLSI applications. IEEE Trans. on Computers. C-35(12), 1013–1024 (1986)
Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1986)
Yeh, C.S., Reed, S., Truong, T.K.: Systolic multipliers for finite fields GF(2m). IEEE Trans. on Computers. C-33, 357–360 (1984)
Jain, S.K., Song, L.: Efficient Semisystolic Architectures for finite field Arithmetic. IEEE Trans. on VLSI Systems. 6(1), 101–113 (1998)
Massey, J.L., Omura, J.K.: Computational method and apparatus for finite field arithmetic. U. S. Patent application (1981) (submitted)
Wei, S.W.: A systolic power-sum circuit for GF(2m). IEEE Trans. on Computers 43, 226–229 (1994)
Itoh, T., Tsujii, S.: Structure of parallel multipliers for a class of finite fields GF(2m). Info. Comp. 83, 21–40 (1989)
Fenn, S.T.J., Parker, M.G., Benaissa, M., Taylor, D.: Bit-serial Multiplication in GF(2m) using irreducible all one polynomials. In: IEE. Proc. Comput. Digit. Tech., vol. 144(6) (November 1997)
Kim, H.S.: Serial AOP Arithmetic Architecture for Modular Exponentiation. Ph. D. Thesis, Kyungpook National Univ. (2002)
Pal, P., Barua, R.: Cellular Automata Based VLSI Architecture for Computing Multiplication and Inverses in GF(2m). In: IEEE 7th International Conference on VLSI Design (January 1994)
Knuth, D.E.: The Art of Computer Programming: Seminumerical Algorithms, vol. 2. Addison-Wesley, Reading (1998)
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
Kim, HS., Yoo, KY. (2004). Cellular Automata Based Multiplier for Public-Key Cryptosystem. In: Hutter, D., Müller, G., Stephan, W., Ullmann, M. (eds) Security in Pervasive Computing. Lecture Notes in Computer Science, vol 2802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39881-3_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-39881-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20887-7
Online ISBN: 978-3-540-39881-3
eBook Packages: Springer Book Archive