A faster modular multiplication algorithm
From MaRDI portal
Recommendations
- Modular Multiplication Without Trial Division
- New frameworks for Montgomery’s modular multiplication method
- Fast algorithms for implemention of Montgomery's modular multiplication technique
- A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
- Fast modular multiplication using 2-power radix
Cites work
Cited in
(37)- scientific article; zbMATH DE number 2104055 (Why is no real title available?)
- scientific article; zbMATH DE number 24466 (Why is no real title available?)
- Recursive Double-Size Modular Multiplications without Extra Cost for Their Quotients
- scientific article; zbMATH DE number 1979274 (Why is no real title available?)
- Efficient Modular Arithmetic
- scientific article; zbMATH DE number 3961705 (Why is no real title available?)
- Exploiting Linearity of Modular Multiplication
- Rapid multiplication modulo the sum and difference of highly composite numbers
- A generalisation of Brickell's algorithm for fast modular multiplication
- scientific article; zbMATH DE number 62666 (Why is no real title available?)
- Fast direct computation of modular reduction
- scientific article; zbMATH DE number 5679233 (Why is no real title available?)
- Representation of numbers with negative digits and multiplication of small integers
- An efficient modulo p multiplication algorithm with moderate factors of p+1 and p-1
- Fast algorithms for implemention of Montgomery's modular multiplication technique
- A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
- Algorithms and Computation
- A new algorithm for residue multiplication modulo \(2^{521}-1\)
- scientific article; zbMATH DE number 2127886 (Why is no real title available?)
- Selected Areas in Cryptography
- Topics in Cryptology – CT-RSA 2004
- Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
- An Algorithm for Multiplication in Modular Arithmetic
- Montgomery reduction with even modulus
- Efficient and formally proven reduction of large integers by small moduli
- Compact SD: a new encoding algorithm and its application in multiplication
- A new modulo computation algorithm
- Another look at some fast modular arithmetic methods
- Multiplication on large simple modules based on Barrett's minimally redundant modular scheme
- Modular Multiplication Without Trial Division
- scientific article; zbMATH DE number 4191561 (Why is no real title available?)
- Efficient algorithms for remainder computation and exponentiation of long numbers
- New algorithms for relaxed multiplication
- Efficient modular reduction algorithm in \(\mathbb F_q[x]\) and its application to ``left to right modular multiplication in \(\mathbb F_2[x]\).
- Fast modular multiplication using 2-power radix
- An iterative modular multiplication algorithm in RNS
- Fast integer multiplication using modular arithmetic
This page was built for publication: A faster modular multiplication algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3979695)
