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

DOI10.1016/J.AMC.2006.06.089zbMath1109.68129OpenAlexW2054293188MaRDI QIDQ870135

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

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

modular exponentiationalgorithm analysisMontgomery algorithmcanonical-signed-digit recodingexponent-folding technique

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (2)

Parallel algorithms for modular multi-exponentiation ⋮ Accelerating Oblivious Transfer with Batch Multi-exponentiation

Cites Work

• Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• Modular Multiplication Without Trial Division
• Optimal left-to-right binary signed-digit recoding
• Fast exponentiation in subgroups of finite fields
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• A Survey of Fast Exponentiation Methods
• Fast exponentiation by folding the signed-digit exponent in half
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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