An iterative modular multiplication algorithm in RNS
From MaRDI portal
Publication:814756
Recommendations
- An iterative modular multiplication algorithm
- An RNS Montgomery modular multiplication algorithm
- New iterative algorithms for modular multiplication
- Novel RNS Parameter Selection for Fast Modular Multiplication
- New efficient structure for a modular multiplier for RNS
- A fast modular multiplication algorithm
- An Algorithm for Multiplication in Modular Arithmetic
- scientific article; zbMATH DE number 4191561
- A faster modular multiplication algorithm
- scientific article; zbMATH DE number 1294069
Cites work
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- A Computer Algorithm for Calculating the Product AB Modulo M
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A study of the residue-to-binary converters for the three-moduli sets
- An RNS Montgomery modular multiplication algorithm
- An iterative modular multiplication algorithm
- Modular Multiplication Without Trial Division
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- Montgomery reduction with even modulus
Cited in
(9)- A Low-Complexity High-Radix RNS Multiplier
- A low-complexity combinatorial RNS multiplier
- Revisiting sum of residues modular multiplication
- Modular multiplication using the core function in the residue number system
- New iterative algorithms for modular multiplication
- Highly parallel modular multiplication in the residue number system using sum of residues reduction
- Parallel Processing and Applied Mathematics
- Four moduli RNS bases for efficient design of modular multiplication
- Improving modular inversion in RNS using the plus-minus method
This page was built for publication: An iterative modular multiplication algorithm in RNS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814756)