Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication

Abstract

The modular multiplication operation is the most time-consuming operation for number-theoretic cryptographic algorithms involving large integers, such as RSA and Diffie-Hellman. Implementations reveal that more than 75 percent of the time is spent in the modular multiplication function within the RSA for more than 1,024-bit moduli. There are fast multiplier… (More)
DOI: 10.1109/TC.2016.2601334

15 Figures and Tables

Topics

  • Presentations referencing similar topics