Fast modular multiplication based on complement representation and canonical recoding

DOI10.1080/00207160903033630zbMath1203.94141OpenAlexW1965773781MaRDI QIDQ3066940

Der-Chyuan Lou, Chia-Long Wu, Te-Jen Chang

Publication date: 20 January 2011

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

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

zbMATH Keywords

complexity analysisnumber theorymodular arithmeticalgorithm designcanonical recoding

Mathematics Subject Classification ID

Decoding (94B35) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (1)

Compact SD: a new encoding algorithm and its application in multiplication

Cites Work

• Unnamed Item
• Quadratic residues and the combinatorics of sign multiplication
• Fast binary multiplication by performing dot counting and complement recoding
• Efficient implementation of algorithms for approximate exponentiation
• A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
• 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
• Fast exponentiation by folding the signed-digit exponent in half

This page was built for publication: Fast modular multiplication based on complement representation and canonical recoding