Fast algorithms for implemention of Montgomery's modular multiplication technique
From MaRDI portal
Recommendations
Cited in
(14)- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
- scientific article; zbMATH DE number 54561 (Why is no real title available?)
- scientific article; zbMATH DE number 1504802 (Why is no real title available?)
- scientific article; zbMATH DE number 1882024 (Why is no real title available?)
- A generalisation of Brickell's algorithm for fast modular multiplication
- scientific article; zbMATH DE number 2230910 (Why is no real title available?)
- High-radix and bit recoding techniques for modular exponentiation
- Fast binary multiplication by performing dot counting and complement recoding
- Fast direct computation of modular reduction
- New frameworks for Montgomery’s modular multiplication method
- Implementation of the DKSS algorithm for multiplication of large numbers
- A comment on ``An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
- Another look at some fast modular arithmetic methods
- Efficient algorithms for remainder computation and exponentiation of long numbers
This page was built for publication: Fast algorithms for implemention of Montgomery's modular multiplication technique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770035)