High-Radix Montgomery Modular Exponentiation on Reconfigurable Hardware
IEEE Transactions on Computers
Performance-Scalable Array Architectures for Modular Multiplication
Journal of VLSI Signal Processing Systems
An RNS Montgomery Modular Multiplication Algorithm
IEEE Transactions on Computers
A Scalable Architecture for Montgomery Multiplication
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
CHES '00 Proceedings of the Second International Workshop on Cryptographic Hardware and Embedded Systems
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
High-Radix Design of a Scalable Modular Multiplier
CHES '01 Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems
Hardware architectures for public key cryptography
Integration, the VLSI Journal
A Scalable Architecture for Modular Multiplication Based on Montgomery's Algorithm
IEEE Transactions on Computers
Security on FPGAs: State-of-the-art implementations and attacks
ACM Transactions on Embedded Computing Systems (TECS)
A Hardware Algorithm for Modular Multiplication/Division
IEEE Transactions on Computers
Parallelized radix-4 scalable montgomery multipliers
Proceedings of the 20th annual conference on Integrated circuits and systems design
Compact modular exponentiation accelerator for modern FPGA devices
Computers and Electrical Engineering
Hardware Complexity of Modular Multiplication and Exponentiation
IEEE Transactions on Computers
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
Simulations of modular multipliers on FPGA
AsiaMS '07 Proceedings of the IASTED Asian Conference on Modelling and Simulation
An efficient implementation of montgomery powering ladder in reconfigurable hardware
SBCCI '10 Proceedings of the 23rd symposium on Integrated circuits and system design
International Journal of Reconfigurable Computing - Special issue on selected papers from the southern programmable logic conference (SPL2010)
Revisiting sum of residues modular multiplication
Journal of Electrical and Computer Engineering
Bipartite modular multiplication
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
Attacking RSA---CRT signatures with faults on montgomery multiplication
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
FPGA based unified architecture for public key and private key cryptosystems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.01 |
Until now the use of high radices to implement modular multiplication has been questioned, because it involves complex determination of quotient digits for the modulo reduction. This paper presents algorithms that are obtained through rewriting of Montgomery's algorithm. The determination of quotients becomes trivial and the cycle time becomes independent of the choice of radix. It is discussed how the critical path in the loop can be reduced to a single shift-and-add operation. This implies that a true speed up is achieved by choosing higher radices.