Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms

Authors:
G. A. Jullien
Affiliations:
Department of Electrical Engineering, University of Windsor
Venue:
IEEE Transactions on Computers
Year:
1980

Citing 4
Cited 3

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Residue Number Scaling and Other Operations Using ROM Arrays

IEEE Transactions on Computers
The Discrete Fourier Transform Over Finite Rings with Application to Fast Convolution

IEEE Transactions on Computers
Algebraic theory of finite fourier transforms

Journal of Computer and System Sciences

U. Meyer-Baese, A. Lloris: Fast RNS FPL-based Communications Receiver Design and Implementation

FPL '02 Proceedings of the Reconfigurable Computing Is Going Mainstream, 12th International Conference on Field-Programmable Logic and Applications
Read-Only Memory Implementation of Discrete Functions

IEEE Transactions on Computers
Processor Architectures for Two-Dimensional Convolvers Using a Single Multiplexed Computational Element with Finite Field Arithmetic

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

This paper discusses a technique for multiplying numbers, modulo a prime number, using look-up tables stored in read-only memories. The application is in the computation of number theoretic transforms implemented in a ring which is isomorphic to a direct sum of several Galois fields, parallel computations being performed in each field.