High-radix and bit recoding techniques for modular exponentiation
From MaRDI portal
Recommendations
- Fast algorithms for implemention of Montgomery's modular multiplication technique
- scientific article; zbMATH DE number 2188494
- An algorithm for modular exponentiation.
- Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques
- An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A SIGNED BINARY MULTIPLICATION TECHNIQUE
- An 0(n) Parallel Multiplier with Bit-Sequential Input and Output
- scientific article; zbMATH DE number 3732172 (Why is no real title available?)
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 48133 (Why is no real title available?)
Cited in
(8)- Subtraction-free almost Montgomery inverse algorithm
- Efficient algorithms for remainder computation and exponentiation of long numbers
- Very-high radix CORDIC rotation based on selection by rounding
- Fast algorithms for implemention of Montgomery's modular multiplication technique
- Analysis of sliding window techniques for exponentiation
- Redundant integer representations and fast exponentiation
- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
- scientific article; zbMATH DE number 2188494 (Why is no real title available?)
This page was built for publication: High-radix and bit recoding techniques for modular exponentiation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3991119)
