Fast modular transforms via division

Authors:
R. Moenck;A. Borodin
Affiliations:
-;-
Venue:
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Year:
1972

Citing 0
Cited 7

Approximate complex polynomial evaluation in near constant work per point

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Algebraic complexity theory

IBM Journal of Research and Development
Polynomial evaluation and interpolation on special sets of points

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Fast modular transforms

Journal of Computer and System Sciences
Newton's method and FFT trading

Journal of Symbolic Computation
On the bit-complexity of sparse polynomial and series multiplication

Journal of Symbolic Computation
McBits: fast constant-time code-based cryptography

CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that the problem of evaluating an Nth degree polynomial is reducible to the problem of dividing the polynomial. A method for dividing an Nth degree polynomial by an N/2 degree polynomial in O(N log 2N) steps is given. Using this it is shown that the evaluation of an Nth degree polynomial at N points can be done in O(N log 3N). The related problem of computing of computing the resides of an N precision integer is handed by the same algorithm in O(N log2N loglogN) steps. Using the methods of Horowitz11 and Heindel8 it is shown that interpolation of an Nth degree polynomial is redicible to the problem of evaluating an Nth degree polynomial at N points. An algorithm for preconditioned polynomial interpolation requiring O(N log 2N) steps is presented. This is then extended to perform the complete interpolation in O(N log 3N) steps. A modified version of Reminider Problem in O(N log 2N loglogN) steps.