Fast batch modular exponentiation with common-multiplicand multiplication
From MaRDI portal
Recommendations
- Improved batch exponentiation
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Fast modular multi-exponentiation using modified complex arithmetic
- scientific article; zbMATH DE number 2230910
Cites work
- scientific article; zbMATH DE number 177038 (Why is no real title available?)
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
- An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Efficient signature generation by smart cards
- Improved batch exponentiation
- Modular Multiplication Without Trial Division
- Multi-exponentiation (cryptographic protocols)
Cited in
(5)- Improved batch exponentiation
- Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
- Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
- A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- A common-multiplicand method to the Montgomery algorithm for speeding up exponentiation.
This page was built for publication: Fast batch modular exponentiation with common-multiplicand multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2410573)
