IEEE Transactions on Computers · 1980 · 90 citations · 10 references
Natural SciencesComputer EngineeringComputer ScienceAlgebraComputer ArchitectureNumber TheoryArithmetic FunctionsData ParallelismLookup TablesModular ArithmeticNumber-theoretic AlgorithmsParallel Data StructuresApplications In Computational Number TheoryArithmetic Functions Modulo PrimeArithmetic Of Finite FieldsDirect Sum TheoremsExponentiation AlgorithmsFinite Field ArithmeticMulti-digit MultiplicationRead-only Memory
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.
10
Handbook of Mathematical Functions
Donald A. McQuarrie · American Journal of Physics · 1966 · 40.9K citations
The fast Fourier transform in a finite field
J. M. Pollard · Mathematics of Computation · 1971 · 415 citations
The Fast Fourier Transform in a Finite Field
J. M. Pollard · Mathematics of Computation · 1971 · 190 citations · Full text