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

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

DOI QR Code

Bit-sliced Modular Multiplication Algorithm and Implementation

비트 확장성을 갖는 모듈러 곱셈 알고리즘 및 모듈러 곱셈기 설계

  • 류동렬 (현대전자산업 통신시스템 BU)
  • Published : 2000.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we propose a bit-sliced modular multiplication algorithm and a bit-sliced modular multiplier design meeting the increasing crypto-key size for RSA public key cryptosystem. The proposed bit-sliced modular multiplication algorithm was designed by modifying the Montgomery's algorithm. The bit-sliced modular multiplier is easy to expand to process large size operands and can be immediately applied to RSA public key cryptosystem.

Keywords

References

  1. 한국통신보호학회지 v.2 no.3 모듈러 지수승 연산 알고리즘 이석래(외)
  2. 현대 암호학 한국전자통신연구원
  3. 한국통신보호학회지 v.3 no.2 고속 암호화 기법에 대한 분석 박태규;황대준
  4. 한국통신정보보호학회논문지 v.7 no.2 모듈라 멱승 연산의 빠른 수행을 위한 덧셈사슬 휴리스틱과 모듈라 곱셈 알고리즘들 홍성민;오상엽;윤현수
  5. Mathematics of Computation v.44 no.170 Modular multiplication without trial division P. L. Montgomery
  6. Applied Cryptography(4th ed.) A. J. Menezes;P. C. van Oorschot;S. A. Vanstone
  7. KIISC Review v.4 no.3 An implementation and analysis of modular multiplication on PC H. S. Hwang(et al.)
  8. IEEE Trans. on Computers v.42 no.3 Systolic modular multiplication C. D. Walter
  9. IEEE Micro v.16 no.3 Analyzing and comparing Montgomery multiplication algorithms C. K. Koc;T. Acar;B. S. Kaliski Jr.
  10. IEE Proceedings: Computers and Digital Techniques v.141 no.5 Montgomery reduction with even modulus C. K. Koc
  11. IEEE Symposium on Computer Arithmetic High-radix modular multiplication for cryptosystems P. Kornerup
  12. CHES 99 Lecture Notes in Computer Science no.1717 A scalable architecture for montgomery multiplication. cryptographic hardware and embedded systems F. Tenca;C. K. Koc
  13. 수론과 암호학 서광석(외)
  14. Proceedings of Third Annual Workshop on Selected Areas in Cryptography v.14 no.1 Montgomery multiplication in GF(2^k) C. K. Koc;T. Acar