A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.

DOI10.1016/S0020-0190(98)00031-3zbMath1078.94512MaRDI QIDQ2583543

Sangjae Moon, Jae-Cheol Ha

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

CryptographyModular arithmeticPublic key cryptosystemCommon-multiplicand multiplicationFast exponentiation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (8)

Linear systolic multiplier/squarer for fast exponentiation ⋮ An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques ⋮ Fast batch modular exponentiation with common-multiplicand multiplication ⋮ Fast modular multi-exponentiation using modified complex arithmetic ⋮ Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques ⋮ Improved batch exponentiation ⋮ Fast modular multiplication based on complement representation and canonical recoding ⋮ An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

Cites Work

• Unnamed Item
• Unnamed Item
• Modular Multiplication Without Trial Division
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.