Finite field linear algebra subroutines
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Modern Computer Algebra
Improved Division by Invariant Integers
IEEE Transactions on Computers
| Hi-index | 0.00 |
We show how to improve the efficiency of the computation of fast Fourier transforms over F"p where p is a word-sized prime. Our main technique is optimisation of the basic arithmetic, in effect decreasing the total number of reductions modulo p, by making use of a redundant representation for integers modulo p. We give performance results showing a significant improvement over Shoup@?s NTL library.