An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques

DOI10.1016/J.AMC.2006.06.089zbMATH Open1109.68129OpenAlexW2054293188MaRDI QIDQ870135FDOQ870135

Authors Der-Chyuan Lou, Jui-Chang Lai, Chia-Long Wu, Te-Jen Chang

Publication date 12 March 2007

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.06.089

zbMATH Keywords

algorithm analysisMontgomery algorithmmodular exponentiationcanonical-signed-digit recodingexponent-folding technique

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2230910
• scientific article; zbMATH DE number 2188494
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Fast exponentiation by folding the signed-digit exponent in half
• Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques

Cites work

• scientific article; zbMATH DE number 177037 (Why is no real title available?)
• scientific article; zbMATH DE number 177038 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)
• scientific article; zbMATH DE number 3193698 (Why is no real title available?)
• A Survey of Fast Exponentiation Methods
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• Computer arithmetic algorithms.
• Fast exponentiation by folding the signed-digit exponent in half
• Fast exponentiation in subgroups of finite fields
• Modular Multiplication Without Trial Division
• New directions in cryptography
• Optimal left-to-right binary signed-digit recoding

Cited in

(10)

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• Accelerating oblivious transfer with batch multi-exponentiation
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
• Fast exponentiation by folding the signed-digit exponent in half
• High-radix and bit recoding techniques for modular exponentiation
• scientific article; zbMATH DE number 2188494 (Why is no real title available?)
• scientific article; zbMATH DE number 2230910 (Why is no real title available?)
• Parallel algorithms for modular multi-exponentiation

This page was built for publication: An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques

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