Browse > Article

Design of Partitioned $AB^2$ Systolic Modular Multiplier  

Lee, Jin-Ho (경일대학교 컴퓨터공학부)
Kim, Hyun-Sung (경일대학교 컴퓨터공학부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.31, no.1C, 2006 , pp. 87-92 More about this Journal
Abstract
An $AB^2$ modular operation is an efficient basic operation for the public key cryptosystems and various systolic architectures for $AB^2$ modular operation have been proposed. However, these architectures have a shortcoming for cryptographic applications due to their high area complexity. Accordingly, this paper presents an partitioned $AB^2$ systolic modular multiplier over GF($2^m$). A dependency graph from the MSB $AB^2$ modular multiplication algorithm is partitioned into 1/3 to get an partitioned $AB^2$ systolic multiplier. The multiplier reduces the area complexity about 2/3 compared with the previous multiplier. The multiplier could be used as a basic building block to implement the modular exponentiation for the public key cryptosystems based on smartcard which has a restricted hardware requirements.
Keywords
cryptoprocessor; finite fields; modular multiplier; public key cryptosystem;
Citations & Related Records
연도 인용수 순위
  • Reference
1 W. W. Peterson and E. J. Weldon, ErrorCorrecting Codes, Cambridge, MA: MIT Press, 1972
2 S. W. Wei, 'A systolic power-sum circuit for $GF(2^m)$ , ' IEEE Trans. on Computers, 43, pp. 226-229, 1994   DOI   ScienceOn
3 A. J. Menezes, Elliptic Curve Public Key Cryptosystems, Boston, MA: Kluwer Academic Publishers, 1993
4 S. W. Wei, 'VLSI architecture for computing exponentiations, multiplicative inverse, and divisions in $GF(2^m)$ , ' IEEE Trans. on Circuits and Systems, 44, pp. 847-855, 1997
5 W. Diffie and M. Hellman, 'New Directions in Cryptography,' IEEE Trans. on Info. Theory, 22, pp. 644-654, 1976   DOI
6 H. S. Kim, Bit-Serial AOP Arithmetic Architecture for Modular Exponentiation, Ph.D. Thesis, Kyungpook National University, 2002
7 R. Lid!, H. Niederreiter, and P. M. Cohn, Finite Fields(Encyclopedia of Mathematics and Its Applications), Cambridge University Press, 1997
8 I. S. Reed and T. K. Truong, 'The use of finite fields to compute convolutions,' IEEE Trans. Inform. Theory, IT-21, pp. 208-213, Mar. 1975
9 N. Y. Kim, H. S. Kim, and K. Y. Yoo, 'Computation of $AB^2$ multiplication in $GF(2^m)$ using low-complexity systolic architecture,' lEE Proc.-Circuits Devices Sys., 150(2), pp. 119-123, 2003
10 D. E. R. Denning, Cryptography and data security, Reading, MA: Addison-Wesley, 1983
11 D. E. Knuth, The art of Computer Programing. Volume 2: Seminumerical Algorithms, Addison-Wesley, Reading, Massachusetts, 2nd edition, 1997
12 C. L. Wang and J. H. Guo, 'New systolic arrays for $C+AB^2$ inversion, and division in $GF(2^m)$, ' IEEE Trans. on Computers, 49, pp. 1120-1125, 2000   DOI   ScienceOn