IEEE - Institute of Electrical and Electronics Engineers, Inc. - Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication

Author(s): Wangchen Dai ; Donald Donglong Chen ; Ray C. C. Cheung ; Cetin Kaya Koc
Sponsor(s): IEEE Comput. Soc. Tech. Committee on Distributed Process
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 March 2017
Volume: 66
Page(s): 375 - 388
ISSN (Paper): 0018-9340
DOI: 10.1109/TC.2016.2601334
Regular:

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... View More

Advertisement