Abstract
This paper presents bit-serial arithmetic architectures for GF(2m) based on an irreducible all one polynomial. First, modular multiplier and squarer are designed. Then, two arithmetic architectures are proposed based on the modular multiplier and squarer. Proposed architectures hybrid the advantages of hardware and time complexity from previous architectures. They can be used as kernel architecture for modular exponentiations, which is very important operation in the most of public key cryptosystem. Since the multipliers have low hardware requirements and regular structures, they are suitable for VLSI implementation.
This work was partially supported by the research fund with grant No. 2000-2-51200-001-2 from Korea Science & Engineering Science and by the research fund of Kyungil University.
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
T. ElGamal. “A public key cryptosystem and a signature scheme based on discrete logarithms,” IEEE Trans. on Info. Theory, vol. 31(4). pp. 469–472, July.
W. Diffie and M.E. Hellman, “New directions in cryptography,” IEEE Trans. on Info. Theory, vol. 22, pp. 644–654, Nov. 1976.
R.J. McEliece, Finite Fields for Computer Scientists and Engineers, New York: Kluwer-Academic, 1987.
D.E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, Reading, MA:Addison-Welsey, 1969.
S.T.J. Fenn, M.G. Parker, M. Benaissa, and D. Tayler, “Bit-serial multiplication in GF(2m) using irreducible all-one opolynomial,” IEE Proc. Comput. Digit. Tech., Vol. 144, No.6 pp. 391–393, 1997.
T. Itoh and S. Tsujii, “Structure of parallel multipliers for a class of fields GF(2m),” Info. Comp., Vol. 83, pp. 21–40, 1989.
C.Y. Lee, E.H. Lu, and J.Y. Lee, “Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials,” IEEE Trans. on Comp., Vol. 50, pp. 385–393, 2001.
C.L. Wang and J.L. Lin, “Systolic Array Implementation of Multiplier for Finite Fields GF(2m),” IEEE Trans. on Circuits and Systems, Vol. 38, pp. 796–800, July 1991.
H.S. Kim and K.Y. Yoo, “Area Efficient Exponentiation using Modular Multiplier/Squarer in GF(2m),” Lecture Notes in Computer Science 2180, pp. 262–267, 2001.
N.Y. Kim, H.S. Kim, and K.Y. Yoo, “Efficient Systolic Architectures for AB2 multiplication in GF(2m),” Submitted for publication, Oct. 2001.
H.S. Kim, Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation, Ph.D Thesis, Kyungpook National University, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyun-Sung, K., Kee-Young, Y. (2002). Bit-Serial AOP Arithmetic Architectures over GF(2m). In: Davida, G., Frankel, Y., Rees, O. (eds) Infrastructure Security. InfraSec 2002. Lecture Notes in Computer Science, vol 2437. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45831-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-45831-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44309-4
Online ISBN: 978-3-540-45831-9
eBook Packages: Springer Book Archive