Fast modular multiplication based on complement representation and canonical recoding
From MaRDI portal
Publication:3066940
DOI10.1080/00207160903033630zbMATH Open1203.94141OpenAlexW1965773781MaRDI QIDQ3066940FDOQ3066940
Authors: Chia-Long Wu, Der-Chyuan Lou, 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
Recommendations
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- Title not available (Why is that?)
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- Optimal left-to-right binary signed-digit recoding
- Fast exponentiation by folding the signed-digit exponent in half
- Parallel computation of the multi-exponentiation for cryptosystems
- 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
Cited In (3)
This page was built for publication: Fast modular multiplication based on complement representation and canonical recoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066940)