Faster arithmetic for number-theoretic transforms
Symbolic Computation
2013-09-26 v2 Data Structures and Algorithms
Abstract
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.
Cite
@article{arxiv.1205.2926,
title = {Faster arithmetic for number-theoretic transforms},
author = {David Harvey},
journal= {arXiv preprint arXiv:1205.2926},
year = {2013}
}
Comments
9 pages, a few minor changes and reorganisation, to appear in JSC