Browse > Article

Design of $AB^2 $ Multiplier for Public-key Cryptosystem  

김현성 (경일대학교 컴퓨터학과)
유기영 (경북대학교 컴퓨터학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.2, 2003 , pp. 93-98 More about this Journal
Abstract
This paper presents two new algorithms and their architectures for $AB^2 $ multiplication over $GF(2^m)$.First, a new architecture with a new algorithm is designed based on LFSR (Linear Feedback Shift Register) architecture. Furthermore, modified $AB^2 $ multiplier is derived from the multiplier. The multipliers and the structure use AOP (All One Polynomial) as a modulus, which hat the properties of ail coefficients with 1. Simulation results thews that proposed architecture has lower hardware complexity than previous architectures. They could be. Therefore it is useful for implementing the exponential ion architecture, which is the tore operation In public-key cryptosystems.
Keywords
Public-key Cryptosystem; Finite Fields Arithmetic; AOP Architecture; LFSR Architecture;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W. W. Peterson and E. J. Weldon, Error-Correcting Codes, Cambridge, MA: MIT Press, 1972
2 D. E. R. Denning, Cryptography and data security, Reading, MA: Addison-Wesley, 1983
3 I. S. Reed and T. K. Truong,' The use of finite fields to compute convolutions,' IEEE Trans. Inform. Theory, vol. IT-21, pp.208-213, Mar. 1975
4 E. R. Berlekamp, Algebraic Coding Theory, New York: McGraw-Hill, 1968
5 R. Lidl, H. Niederreiter, and P. M. Cohn, Finite Fields (Encyclopedia of Mathematics and Its Applications), Cambridge University Press, 1997
6 A. M. Odlyzko, 'Discrete logarithms in finite fields and their cryptographic significance,' in Adv. Cryptol., Proc. Eurocrypt 84, Paris, France, pp.224-314, Apr. 1984
7 W. Diffie and M. Hellman,' New Directions in Cryptography,' IEEE Trans. on Info. Theory, vol. 22, pp.644-654, 1976   DOI
8 D. E. Knuth, The art of Computer Programing. Volume 2: Seminumerical Algorithms, Addison-Wesley, Reading, Massachusetts, 2nd edition, 1997
9 R.L. Rivest, A. Shamir, and L. Adleman, 'A Method for Obtaining Digital Signatures and Public-key Cryptosystems,' Comm. ACM. vol. 21, pp. 120-126, 1978   DOI   ScienceOn
10 A.J. Menezes, Elliptic Curve Public Key Cryptosystems, Boston, MA: Kluwer Academic Publishers, 1993
11 T. Itoh and S. Tsujii, Structure of parallel multipliers for a class of fields GF($(2^m)$), Info. Comp., vol. 83, pp. 21-40, 1989   DOI
12 C. L. Wang and Y. H. Guo,' New Systolic for $AB^2+C$, Inversoin and Division in GF(2m),' IEEE Trans. on Computres, Vol.49, No.10, pp.1120-1125, Otc. 2000   DOI   ScienceOn
13 S.-W. Wei, VLSI architectures for computing exponentiations, multiplications, multiplicative inverses, and divisions in GF($2^m$), IEEE Trans. Circuit & Syst.-: Analog and Digital Signal Processing, vol.44, no.10, pp.847-855, Oct. 1997   DOI   ScienceOn
14 N. Y. Kim, H. S. Kim, and K. Y. Yoo, Efficient Systolic Architectures for AB^2 Multiplication in $GF(2^m)$, Will be published to LNCS, May 2002
15 S.T.J. Fenn, M.G. Parker, M. Benaissa, and D. Tayler, Bit-serial multiplication in GF($2^m$) using irreducible all-one opolynomial, IEE Proc. Comput. Digit. Tech., vol. 144, no.6 pp. 391-393, 1997   DOI   ScienceOn
16 H.S. Kim, Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation, Ph.D. Thesis, Kyungpook National University, 2002
17 C.H. Liu, N.F. Huang, and C.Y. Lee, Computation of $AB^2$ Multiplier in GF($2^m$) Using an Efficient Low-Complexity Cellular Architecture, IEICE Trans. Fundamentals, vol. E83-A, no.12, pp. 2657-2663, 2000