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
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
algorithm analysisMontgomery algorithmmodular exponentiationcanonical-signed-digit recodingexponent-folding technique
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- Modular Multiplication Without Trial Division
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- A Survey of Fast Exponentiation Methods
- Computer arithmetic algorithms.
- Title not available (Why is that?)
- Optimal left-to-right binary signed-digit recoding
- Fast exponentiation in subgroups of finite fields
- A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
- Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
- Title not available (Why is that?)
- Fast exponentiation by folding the signed-digit exponent in half
- Title not available (Why is that?)
Cited In (10)
- Fast exponentiation by folding the signed-digit exponent in half
- Title not available (Why is that?)
- Accelerating Oblivious Transfer with Batch Multi-exponentiation
- Title not available (Why is that?)
- High-radix and bit recoding techniques for modular exponentiation
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Parallel algorithms for modular multi-exponentiation
- A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- An Algorithmic and Architectural Study on Montgomery Exponentiation in RNS
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)
