Efficient forward and reverse converters for a new high-radix moduli set

Molahosseini, Amir Sabbagh; Navi, Keivan; Rafsanjani, Marjan Kuchaki

doi:10.1109/itsim.2008.4631946

Cited by 2 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The arithmetic unit of the residue number system includes the modular adder, multiplier, and subtractor for each modulus channel [31][32]. The residue numbers are converted to their weighted equivalents in the binary system by a reverse converter to utilize the outcomes of arithmetic operations [33][34]. Reverse converter algorithms are basically based on the mixed-radix conversion (MRC) [35], Chinese remainder theorem (CRT) [36][37], new Chinese remainder-1 [38][39], and new Chinese remainder-2 [40].…”

Section: Rns Backgroundmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Implementation Of The Sum Of Residues Modular Reduction Using Arithmetic-Friendly RNS Moduli Set

Alvani

2024

EATP

View full text Add to dashboard Cite

Introduction: Due to the importance of public-key cryptography in information and communication security, it is widely employed in various applications for secure communication. Materials and Methods: multiplication and exponentiation of large numbers are used in cryptography algorithms such as RSA, ElGamal, and elliptic curve cryptography. Results and Discussion: The residue number system in these algorithms is very efficient since calculations are performed on small residues, resulting in a fast arithmetic operation, as well as lower power consumption. The modular reduction of large numbers is one of the main operations in most public-key cryptography systems, which includes large computations in finite fields. This paper presents an efficient implementation of modular reduction. To this end, arithmetic-friendly moduli were selected and employed in the implementation of the improved sum of residues reduction algorithm. The SOR algorithm using the proposed moduli set was described in VHDL language and synthesized on the Xilinx virtex7 FPGA family using ISE14.7 software. Conclusion:The results showed that, compared to the recent similar works, the implementation of the improved sum of residues algorithm using the proposed moduli set has achieved higher speed and uses less hardware resources.

show abstract

Section: Rns Backgroundmentioning

confidence: 99%

“…The computation of α has been debated in [25][26][27][28][29][30][31][32][33][34][35][36][37][38][39][40][41][42][43]. It is shown that selecting suitable constants q,  and performing boundary condition of Eq.…”

Section: Sum Of Residues Reduction Backgroundmentioning

confidence: 99%