Redundant integer representations and fast exponentiation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3812999 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- A SIGNED BINARY MULTIPLICATION TECHNIQUE
- A method for obtaining digital signatures and public-key cryptosystems
- Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers
- An improved binary algorithm for RSA
- High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
- High-radix and bit recoding techniques for modular exponentiation
- Minimum weight modified signed-digit representations and fast exponentiation
- Modular Multiplication Without Trial Division
Cited in
(6)- Speculatively Redundant Continued Logarithm Representation
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Exponent Recoding and Regular Exponentiation Algorithms
- Minimal weight \(k\)-SR representations
- Signed bits and fast exponentiation
- Should one always use repeated squaring for modular exponentiation?
This page was built for publication: Redundant integer representations and fast exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910428)