High Dynamic Range RNS Bases for Modular Multiplication
نویسندگان
چکیده
Modular multiplication is the most important part of public key cryptography algorithm like RSA and elliptic curve cryptography. Residue Number System is an efficient way to speed up these applications because of its carry free nature. Efficiency of modular multiplication in RNS is depending on effective selection of RNS bases. In this work efficient design of RNS bases are reported where comparing to the state-of-the-art, the proposed RNS bases has enjoyed more efficient arithmetic operation and residue/binary to binary/residue conversion. Therefore modular multiplication in RNS is implemented with more speed. Comparison with the best work in literature shows that noticeable improvement in speed has achieved by the proposed RNS bases.
منابع مشابه
Efficient RNS Bases for Cryptography
Residue Number Systems (RNS) are useful for distributing large dynamic range computations over small modular rings, which allows the speed up of computations. This feature is well known, and already used in both DSP and cryptography. In this paper we deal with implementation for huge numbers like those used for ciphering as with RSA or ECC on prime finite fields. Modular multiplication is the m...
متن کاملA Novel High Dynamic Range 5-modulus Set Whit Efficient Reverse Converter and Review Improving Modular Multiplication's Dynamic Range with This Modulus Set
In last years, many modulus sets in the Residue Number System (RNS) for increasing Dynamic Range (DR) and parallelism are presented. Hence, for reach these purposes a new 5-Moduli Set for even n, and its efficient reverse converter design are introduced in this paper. This modulus set contains pair-wise relatively prime, and it offers the maximum feasible DR. New CRT-I and MRC are used to obtai...
متن کاملRNS bases and conversions
Residue Number Systems (RNS) allow the distribution of large dynamic range computations over small modular rings, which allows the speed up of computations. This feature is well known, and already used in both DSP and cryptography. Most of implementations use RNS bases of three elements to reduce the complexity of conversions, but if can increase the number of RNS modular computational channels...
متن کاملOn the Design of RNS Bases for Modular Multiplication
Modular multiplication is the main and basic operation in public key cryptography algorithms like Elliptic Curve Cryptography (ECC). By using Residue Number System (RNS) in these algorithms, large number computation is replaced by computation over the small moduli without carry propagation between moduli. Moduli selection has an important role in the efficiency of modular multiplication. Theref...
متن کاملA Multi-layer Recursive Residue Number System
We present a method to increase the dynamical range of a Residue Number System (RNS) by adding virtual RNS layers on top of the original RNS, where the required modular arithmetic for a modulus on any non-bottom layer is implemented by means of an RNS Montgomery multiplication algorithm that uses the RNS on the layer below. As a result, the actual arithmetic is deferred to the bottom layer. The...
متن کامل