Fast modular multiplication based on complement representation and canonical recoding
From MaRDI portal
Publication:3066940
Recommendations
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Efficient implementation of algorithms for approximate exponentiation
- Fast binary multiplication by performing dot counting and complement recoding
- Fast exponentiation by folding the signed-digit exponent in half
- New directions in cryptography
- Optimal left-to-right binary signed-digit recoding
- Parallel computation of the multi-exponentiation for cryptosystems
- Quadratic residues and the combinatorics of sign multiplication
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)
