• DocumentCode
    2013410
  • Title

    A Novel and Scalable RSA Cryptosystem Based on 32-Bit Modular Multiplier

  • Author

    Hong, Jin-Hua ; Li, Wen-Jie

  • Author_Institution
    Dept. of Electr. Eng., Nat. Univ. of Kaohsiung, Kaohsiung
  • fYear
    2008
  • fDate
    7-9 April 2008
  • Firstpage
    483
  • Lastpage
    486
  • Abstract
    In this paper, we propose a scalable RSA cryptosystem chip, which is implemented with a 32-bit modular multiplier. Our design provides the trade-off between security and computation time. If the security is more important, we can choose longer key to get higher security. Otherwise, the shorter key could be chosen to reduce the computation time. The RSA core takes 2.83 M clocks to finish a 512-bit modular exponentiation in average and the critical path delay is only 3.2 ns. Since a 32-bit modular multiplier is adopted, our chip has lower power and smaller area.
  • Keywords
    logic design; microprocessor chips; multiplying circuits; public key cryptography; 32-bit modular multiplier; 512-bit modular exponentiation; critical path delay; scalable RSA cryptosystem chip design; Clocks; Computer Society; Delay; Electronic commerce; Information security; National security; Public key cryptography; Very large scale integration; Montgomery´s algorithm; RSA; modular multiplier; public-key cryptosystem; scalable;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Symposium on VLSI, 2008. ISVLSI '08. IEEE Computer Society Annual
  • Conference_Location
    Montpellier
  • Print_ISBN
    978-0-7695-3291-2
  • Electronic_ISBN
    978-0-7695-3170-0
  • Type

    conf

  • DOI
    10.1109/ISVLSI.2008.72
  • Filename
    4556846