Fast Base Extension Using a Redundant Modulus in RNS
IEEE Transactions on Computers
Approaching encryption at ISDN speed using partial parallel modulus multiplication
Microprocessing and Microprogramming
A cryptographic library for the Motorola DSP56000
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Redundant Integer Representations and Fast Exponentiation
Designs, Codes and Cryptography - Special issue dedicated to Gustavus J. Simmons
A Library for Parallel Modular Arithmetic
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
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
Hardware Complexity of Modular Multiplication and Exponentiation
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
Fast scaling in the residue number system
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Cox-Rower architecture for fast parallel montgomery multiplication
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Double-size bipartite modular multiplication
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
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
Fast truncated multiplication for cryptographic applications
CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems
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 |
Residue number systems provide a good means for extremely long integer arithmetic. Their carry-free operations make parallel implementations feasible. Some applications involving very long integers, such as public key encryption, rely heavily on fast modulo reductions. This paper shows a new combination of residue number systems with efficient modulo reduction methods. Two methods are compared, and the faster one is scrutinized in detail. Both methods have the same order of complexity, $O(\log n)$, with $n$ denoting the amount of registers involved.Index Terms驴Computer arithmetic, cryptography, distributed systems, hardware algorithms, long integer arithmetic, modulo reduction, parallel algorithms, residue number systems.