Abstract
A diverse variety of algorithms and architectures for modular multiplication have been published. They were recently classified into four classes, i.e. Sum of Residues, Classical, Barrett and Montgomery. This paper provides timing and area results for FPGA implementations and a survey of the four different architectures and wordlengths.
Original language | English |
---|---|
Title of host publication | Proceedings of the IASTED Asian Conference on Modelling and Simulation |
Editors | L. Miao |
Place of Publication | Calgary, Canada |
Publisher | ACTA Press |
Pages | 128-131 |
Number of pages | 4 |
ISBN (Print) | 9780889867017 |
Publication status | Published - 2007 |
Externally published | Yes |
Event | IASTED Asian Conference on Modelling and Simulation - Beijing, China Duration: 8 Oct 2007 → 10 Oct 2007 |
Other
Other | IASTED Asian Conference on Modelling and Simulation |
---|---|
Country/Territory | China |
City | Beijing |
Period | 8/10/07 → 10/10/07 |
Keywords
- Cryptography
- E-security
- FPGA
- Modular multiplication
- Simulations