Fast exponentiation by folding the signed-digit exponent in half

DOI10.1080/00207160310001624223zbMath1049.94012OpenAlexW2152716424MaRDI QIDQ4462117

Chin-Yin Chen, Chia-Long Wu, Der-Chyuan Lou

Publication date: 18 May 2004

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160310001624223

zbMATH Keywords

computational complexitymodular exponentiationpublic-key cryptosystemsigned-digit representationfolding-in-half technique

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Cryptography (94A60) Mathematical problems of computer architecture (68M07)

Related Items (4)

An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Fast binary multiplication by performing dot counting and complement recoding ⋮ Fast modular multiplication based on complement representation and canonical recoding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel computation of the multi-exponentiation for cryptosystems
• Optimal left-to-right binary signed-digit recoding
• 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
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: Fast exponentiation by folding the signed-digit exponent in half