This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
G.A. Jullien, Department of Electrical Engineering, University of Windsor
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.
Index Terms:
table look-up, Indexes, number theoretic transforms, parallel microcomputer systems, residue number systems, ROM arrays
Citation:
G.A. Jullien, "Implementation of Multiplication, Modulo a Prime Number, with Applications to Number Theoretic Transforms," IEEE Transactions on Computers, vol. 29, no. 10, pp. 899-905, Oct. 1980, doi:10.1109/TC.1980.1675473
Usage of this product signifies your acceptance of the Terms of Use.