Browse > Article

A Study of the Modulus Multiplier Design for Speed up Throughput in the Public-key Cryptosystem  

이선근 (원광대학교 전자공학과)
김환용 (원광대학교 전자공학과)
Publication Information
Journal of the Institute of Electronics Engineers of Korea SD / v.40, no.4, 2003 , pp. 51-57 More about this Journal
Abstract
The development of the communication network and the other network method can generate serious social problems. So, it is highly required to control security of network. These problems related security will be developed and keep up to confront with anti-security field such as hacking, cracking. The way to preserve security from hacker or cracker without developing new cryptographic algorithm is keeping the state of anti-cryptanalysis in a prescribed time by means of extending key-length. In this paper, we proposed M3 algorithm for the reduced processing time in the montgomery multiplication part. Proposed M3 algorithm using the matrix function M(.) and lookup table perform optionally montgomery multiplication with repeated operation. In this result, modified repeated operation part produce 30% processing rate than existed montgomery multiplicator. The proposed montgomery multiplication structured unit array method in carry generated part and variable length multiplication for eliminating bottle neck effect with the RSA cryptosystem. Therefore, this proposed montgomery multiplier enforce the real time processing and prevent outer cracking.
Keywords
RSA;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. ElGamal, 'A Public Key Cryptosystem and Signature Scheme Based on Discrete Logarithms', IEEE Trans. Information Theory, Vol. 31, 1985, pp. 469-472   DOI
2 P. L. Montgomery, 'Modular multiplication without trial division', mathematics of computation, Vol. 44, pp. 519-521, 1985   DOI
3 O. Goldreich, 'Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme', In Proceeding CRYPTO'86, Lecture Notes in Computer Science No. 263, Springer-Verlag, 1987, pp. 104-110
4 O. Goldreich, H. Krawczyk, M. Luby, 'On the existence of pseudorandom generators', SIAMJ, on Computing, Vol. 22(6), 1993, pp. 1163-1175   DOI   ScienceOn
5 O. Goldreich, L. A. Levin, 'A Hard-core Predicate for All One-Way Functions', Proceedings of the 21st ACM Symposium on Theory of Computing, 1989, pp. 25-32   DOI
6 C. D. Walter, 'Systolic modular multiplication', IEEE Trans. Comput., Vol. 42, No. 3, pp. 376-378, 1993   DOI   ScienceOn
7 C. N. Zhang, H. L. Martin and D. Y. Yun, 'Parallel algorithms and systolic array designs for RSA cryptosystem', Intel Confer. on systolic arrays, pp. 341-350, 1988   DOI
8 K. Iwamura, T. Matsumoto and H. Imai, 'Systolic arrays for modular exponentiation using montgomery method', Proc. EUROCRYPT'92, pp. 477-481, 1992
9 S. E. Eldridge, C. D. Walter, 'Hardware implementation of montgomery's modular multiplication algorithm', IEEE Trans. Comput., Vol. 42, No. 6, pp. 693-699, 1993   DOI   ScienceOn