Four moduli RNS bases for efficient design of modular multiplication

MaRDI QIDQ3109983zbMATH OpenFDO

Authors Marzieh Gerami, Mohammad Esmaeildoust, Shirin Rezaie, Keivan Navi, Omid Hashemipour

Publication date 26 January 2012

zbMATH Keywords

cryptography algorithmmodular multiplicationresidue number system

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Cryptography (94A60)

Recommendations

• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• An iterative modular multiplication algorithm in RNS
• Single base modular multiplication for efficient hardware RNS implementations of ECC
• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• Parallel Processing and Applied Mathematics

Cited in

(8)

• Single base modular multiplication for efficient hardware RNS implementations of ECC
• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• Methodology for basic selection in recursive residue number system
• Fast base extension using a redundant modulus in RNS
• Parallel Processing and Applied Mathematics
• Revisiting sum of residues modular multiplication
• Implementation schemes for basic modular operations
• Highly parallel modular multiplication in the residue number system using sum of residues reduction

This page was built for publication: Four moduli RNS bases for efficient design of modular multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109983)