2020/09/08 by Javad Bagherzadeh, Bagherzadeh, Javad, Vishishtha Bothra +7
Computer Science · #Cryptographic Implementations and Security #Cryptography and Data Security #Cryptography and Residue Arithmetic #FOS: Computer and information sciences #Hardware Architecture (cs.AR)
paper · pdf · doi:10.48550/arxiv.2009.03468
openalex publication_date 2020/09/08 · openalex created_date 2020/09/14 · openalex updated_date 2026/07/28
Rivest-Shamir-Adleman (RSA) cryptosystem uses modular multiplication for encryption and decryption. So, performance of RSA can be drastically improved by optimizing modular multiplication. This paper proposes a new parallel, high-radix Montgomery multiplier for 1024 bits multi-core RSA processor. Each computation step operates in radix 4. The computation speed is increased by more than 4 times. We also implement a True Random Number Generator based resilience block to protect the coprocessor against power attacks.