Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques

DOI10.1080/00207160412331284150zbMath1098.94026OpenAlexW1991805935MaRDI QIDQ4652740

Der-Chyuan Lou, Chia-Long Wu

Publication date: 28 February 2005

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

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

zbMATH Keywords

Arithmetic AlgorithmFolding TechniqueModular ExponentiationPublic-key CryptosystemsSigned-digit Recoding, Minimal-Hamming-weight

Mathematics Subject Classification ID

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

Related Items (1)

Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques

Cites Work

• Analysis of sliding window techniques for exponentiation
• 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

This page was built for publication: Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques