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

DOI10.1080/00207160701303136zbMath1155.68308OpenAlexW2148968135MaRDI QIDQ5426314

Chia-Long Wu

Publication date: 12 November 2007

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

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

zbMATH Keywords

information theorymultiplicationexponentiationpublic key cryptographyArithmetic algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Mathematical problems of computer architecture (68M07)

Related Items (3)

A fast parallel modular exponentiation algorithm ⋮ Compact SD: a new encoding algorithm and its application in multiplication ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

Cites Work

• Unnamed Item
• Unnamed Item
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• 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
• Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques

This page was built for publication: Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques