Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication

DOI10.1109/TC.2016.2601334MaRDI QIDQ5346069zbMATH OpenFDO

Authors Wangchen Dai, Donald Donglong Chen, Ray C. C. Cheung, Çetin Kaya Koç

Publication date 8 June 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2016.2601334

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Mathematical problems of computer architecture (68M07)

Cited in

(2)

• scientific article; zbMATH DE number 5041007 (Why is no real title available?)
• Modular multiplication in the AMNS representation: hardware implementation

This page was built for publication: Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346069)