An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS

DOI10.1109/TC.2012.84MaRDI QIDQ5274645zbMATH OpenWikidataFDO

Authors Filippo Gandino, Fabrizio Lamberti, Gianluca Paravati, Jean-Claude Bajard, P. Montuschi

Publication date 12 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2012.84

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2230910
• scientific article; zbMATH DE number 1504803
• An RNS Montgomery modular multiplication algorithm
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Applied Cryptography and Network Security
• An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
• An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
• scientific article; zbMATH DE number 1617930
• Optimized algorithms and architectures for Montgomery multiplication for post-quantum cryptography

Cited in

(5)

• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• scientific article; zbMATH DE number 1882024 (Why is no real title available?)
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)

This page was built for publication: An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS

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