Improving modular inversion in RNS using the plus-minus method

DOI10.1007/978-3-642-40349-1_14MaRDI QIDQ2851418zbMATH OpenOpenAlexFDO

Authors Karim Bigou, Arnaud Tisserand

Publication date 10 October 2013

Published in Cryptographic Hardware and Embedded Systems - CHES 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40349-1_14

zbMATH Keywords

ECCextended Euclidean algorithmhardware implementationmodular representationresidue number systemRSA

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Recommendations

• Single base modular multiplication for efficient hardware RNS implementations of ECC
• Analysis and improvement of modular inverse algorithm
• An iterative modular multiplication algorithm in RNS
• Highly parallel modular multiplication in the residue number system using sum of residues reduction
• Subtraction-free almost Montgomery inverse algorithm

Cited in

(1)

• Analysis and improvement of modular inverse algorithm

This page was built for publication: Improving modular inversion in RNS using the plus-minus method

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