Arithmetic division in RNS using Galois field \(GF(p)\)
From MaRDI portal
Publication:1570168
DOI10.1016/S0898-1221(00)00056-0zbMath0958.68005OpenAlexW1978745619MaRDI QIDQ1570168
Publication date: 20 August 2000
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(00)00056-0
Symbolic computation and algebraic computation (68W30) Mathematical problems of computer architecture (68M07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Division and sign detection algorithms for residue number systems
- A new residue number system division algorithm
- An approximate sign detection method for residue numbers and its application to RNS division
- Fast RNS division algorithms for fixed divisors with application to RSA encryption
- Novel approaches to the design of VLSI RNS multipliers
- Residue Number Scaling and Other Operations Using ROM Arrays
- Fast combinatorial RNS processors for DSP applications
- Integer division in residue number systems
- A novel division algorithm for the residue number system
- General Division in the Symmetric Residue Number System
This page was built for publication: Arithmetic division in RNS using Galois field \(GF(p)\)