Journal of the Korea Institute of Information Security & Cryptology (정보보호학회논문지)

Korea Institute of Information Security and Cryptology (한국정보보호학회)
권호 표지
DOI QR코드

DOI QR Code

Implementation and Analysis of the Montgomery Algorithm for the Fast RSA Crypto-System

고속 RSA 암호 시스템을 위한 몽고메리 알고리즘의 구현 및 분석

  • Published : 1999.06.01
⟨ Previous Next ⟩

Abstract

Public key cryptosystem carry out the modular exponentiation of large integer for security, and the modular exponentiation is presented by the serial of the modular multiplication. This thesis presents implementation method for improving performance of modular multiplication based on the Montgomery algorithm which is known as the fastest modular multiplication algorithm. These implementation method is implemented in integer system and in Galois Field(2m), and is compared and analyzed with multiplication, addition, reading and writing memory.

Keywords

References

  1. IEEE Trans. on Info. Theory v.IT-22 no.6 New Directions in Crytography W. Diffie;M. Hellman
  2. Communication of the ACM v.21 A Method for Obtaining Digital Signatures and Public-key Cryptosystems Rivest, R. L.;Shamir, A.;Adleman, L.
  3. IEEE Trans. Information Theory v.IT-31 no.4 A Public-Key Cryptosystem and Signature Scheme Based on Discrete Logarithms T. Elgamal
  4. Lecture Notes in Computer Science 263 Implementing the Rivest Shamir and Adleman Pulblic Key Encryption Algorithm on a Standard Digital Signal Processor, Advances in Cryptology-CRYPTO '86 D. Barret;A. M. Odlyzko(ed.)
  5. Intern. J. comput. Math. v.40 A Faster Modular Multiplication Algorithm E. Eldridge
  6. IEEE Trans on Computers v.42 no.6 Hardware Implementation of Montgomery's Modular Multiplication Algorithm E. Eldridge;C. D. Walter
  7. Advances in Cryptology-CRYPTO '82 A Fast Modular Multiplication Algorithm with Application to Two-Key Cryptography E. F. Brickell;Chaum(et al.)
  8. Electronics Letter v.30 no.17 Fast Square-and-Multiply Exponentiation for RSA Hui, L. C. K.;Lam, K. Y.
  9. Advances in Cryptology-CRYPTO '93 Comparison of Three Modular Reduction Functions Antoon Bosselaers;Rene Govaerts;Joos Vandewalle
  10. Mathemat. of Computat v.44 Modular Multiplication Without Trial Division P. L. Montgomery
  11. Finate Field for Computer Scientists and Engineers R. J. McEliece
  12. Introduction to Finite Fields and Their Application R. Lidl;H. Niederreiter
  13. In Proceedings of Third Workshop on Selected Area in Cryptography Montgomery Multiplication in GF(2k) Koc, C. K.;Acar, T.
  14. IEEE Micro Analyzing and Comparing Montgomery Multiplication Algorithms Koc, C. K.;Acar, T.;Kaliski, jr. B. S.