An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

DOI10.1016/J.INS.2008.10.004zbMath1156.94392OpenAlexW1977356083MaRDI QIDQ1007833

Chia-Long Wu

Publication date: 24 March 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.10.004

zbMATH Keywords

exponentiationpublic-key cryptographycomplexity analysismodular arithmeticsigned-digit recodingcommon-multiplicand-multiplication

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

A fast parallel modular exponentiation algorithm ⋮ Fast batch modular exponentiation with common-multiplicand multiplication

Uses Software

• DSP56000

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
• Fast modular multi-exponentiation using modified complex arithmetic
• Fast binary multiplication by performing dot counting and complement recoding
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• Modular Multiplication Without Trial Division
• 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
• A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
• Complexity and fast algorithms for multiexponentiations
• Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation