Four moduli RNS bases for efficient design of modular multiplication

zbMATH Open1238.65138MaRDI QIDQ3109983FDOQ3109983

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

Publication date: 26 January 2012

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

zbMATH Keywords

residue number systemmodular multiplicationcryptography algorithm

Mathematics Subject Classification ID

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

Cited In (8)

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

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)