Revisiting sum of residues modular multiplication
From MaRDI portal
Publication:543014
Recommendations
- Highly parallel modular multiplication in the residue number system using sum of residues reduction
- Four moduli RNS bases for efficient design of modular multiplication
- Highly parallel modular multiplier for elliptic curve cryptography in residue number system
- Parallel Processing and Applied Mathematics
- An iterative modular multiplication algorithm in RNS
Cites Work
- scientific article; zbMATH DE number 3823144 (Why is no real title available?)
- scientific article; zbMATH DE number 4061135 (Why is no real title available?)
- scientific article; zbMATH DE number 176559 (Why is no real title available?)
- scientific article; zbMATH DE number 1024055 (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?)
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- A Computer Algorithm for Calculating the Product AB Modulo M
- A fast modular multiplication algorithm for calculating the product \(AB\) modulo \(N\)
- Modular Multiplication Without Trial Division
Cited In (2)
This page was built for publication: Revisiting sum of residues modular multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543014)