High-Speed Modular Multiplication Algorithm for RSA Cryptosystem

  • Koon-Shik Cho Je-Hyuk Ryu Jun-Dong Cho
  • Published 2001

Abstract

Both encryption and decryption are modular exponentiation. Therefore, the fast modular exponentiation algorithm is required. For most hardware implementation, the simple square and multiply algorithm, often called binary method, is assumed to be the most effective because of the simple hardware structure and repetitive control. In the RL (Right-to-Left… (More)

1 Figure or Table

Topics

  • Presentations referencing similar topics