Fast Base Extension Using a Redundant Modulus in RNS
IEEE Transactions on Computers
Modulo Reduction in Residue Number Systems
IEEE Transactions on Parallel and Distributed Systems
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
An RNS Montgomery Modular Multiplication Algorithm
IEEE Transactions on Computers
An IWS Montgomery Modular Multiplication Algorithm
ARITH '97 Proceedings of the 13th Symposium on Computer Arithmetic (ARITH '97)
A Fully Parallel Mixed-Radix Conversion Algorithm for Residue Number Applications
IEEE Transactions on Computers
Implementation of RSA Algorithm Based on RNS Montgomery Multiplication
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 Full RNS Implementation of RSA
IEEE Transactions on Computers
A Hardware Algorithm for Modular Multiplication/Division
IEEE Transactions on Computers
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Toward acceleration of RSA using 3D graphics hardware
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
A high speed coprocessor for elliptic curve scalar multiplications over Fp
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
SSLShader: cheap SSL acceleration with commodity processors
Proceedings of the 8th USENIX conference on Networked systems design and implementation
FPGA implementation of pairings using residue number system and lazy reduction
CHES'11 Proceedings of the 13th international conference on Cryptographic hardware and embedded systems
The CRNS framework and its application to programmable and reconfigurable cryptography
ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
Acceleration of composite order bilinear pairing on graphics hardware
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Faster pairing coprocessor architecture
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Improving modular inversion in RNS using the plus-minus method
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.01 |
This paper proposes a fast parallel Montgomery multiplication algorithm based on Residue Number Systems (RNS). It is easy to construct a fast modular exponentiation by applying the algorithm repeatedly. To realize an efficient RNS Montgomery multiplication, the main contribution of this paper is to provide a new RNS base extension algorithm. Cox-Rower Architecture described in this paper is a hardware suitable for the RNS Montgomery multiplication. In this architecture, a base extension algorithm is executed in parallel by plural Rower units controlled by a Cox unit. Each Rower unit is a single-precision modular multiplier-and-accumulator, whereas Cox unit is typically a 7 bit adder. Although the main body of the algorithm processes numbers in an RNS form, efficient procedures to transform RNS to or from a radix representation are also provided. The exponentiation algorithm can, thus, be adapted to an existing standard radix interface of RSA cryptosystem.