Arithmetic division in RNS using Galois field GF(p)

DOI10.1016/S0898-1221(00)00056-0zbMATH Open0958.68005OpenAlexW1978745619MaRDI QIDQ1570168FDOQ1570168

Authors: S. Talahmeh, Pepe Siy 

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

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

zbMATH Keywords

residue number systemcomputer arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical problems of computer architecture (68M07)

Cites Work

• Division and sign detection algorithms for residue number systems
• Novel approaches to the design of VLSI RNS multipliers
• Fast combinatorial RNS processors for DSP applications
• Title not available (Why is that?)
• Residue Number Scaling and Other Operations Using ROM Arrays
• Title not available (Why is that?)
• Integer division in residue number systems
• Title not available (Why is that?)
• 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
• General Division in the Symmetric Residue Number System
• Fast RNS division algorithms for fixed divisors with application to RSA encryption

Cited In (1)

• A division algorithm for residue numbers

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)