Arithmetic division in RNS using Galois field GF(p)
From MaRDI portal
Recommendations
- A new residue number system division algorithm
- A division algorithm for residue numbers
- Fast RNS division algorithms for fixed divisors with application to RSA encryption
- An approximate method for comparing modular numbers and its application to the division of numbers in residue number systems
- Hardware implementation of finite-field division
Cites work
- scientific article; zbMATH DE number 3856404 (Why is no real title available?)
- scientific article; zbMATH DE number 50831 (Why is no real title available?)
- scientific article; zbMATH DE number 3269473 (Why is no real title available?)
- A new residue number system division algorithm
- A novel division algorithm for the residue number system
- An approximate sign detection method for residue numbers and its application to RNS division
- Division and sign detection algorithms for residue number systems
- Fast RNS division algorithms for fixed divisors with application to RSA encryption
- Fast combinatorial RNS processors for DSP applications
- General Division in the Symmetric Residue Number System
- Integer division in residue number systems
- Novel approaches to the design of VLSI RNS multipliers
- Residue Number Scaling and Other Operations Using ROM Arrays
This page was built for publication: Arithmetic division in RNS using Galois field \(GF(p)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1570168)