Fast Fourier Orthogonalization

  title={Fast Fourier Orthogonalization},
  author={L{\'e}o Ducas and Thomas Prest},
  journal={IACR Cryptology ePrint Archive},
The classical fast Fourier transform (FFT) allows to compute in quasi-linear time the product of two polynomials, in the circular convolution ring R[x]/(xd -1) --- a task that naively requires quadratic time. Equivalently, it allows to accelerate matrix-vector products when the matrix is circulant. In this work, we discover that the ideas of the FFT can be applied to speed up the orthogonalization process of matrices with circulant blocks of size d x d. We show that, when d is composite, it is… CONTINUE READING


Publications referenced by this paper.
Showing 1-5 of 5 references

An algorithm for the machine calculation of complex Fourier series

J. W. Cooley, J. W. Tukey
Mathematics of Computation • 1965
View 18 Excerpts
Highly Influenced

Gauss and the history of the fast fourier transform

IEEE ASSP Magazine • 1984
View 15 Excerpts
Highly Influenced

Fast Fourier transform and convolution algorithm

Proceedings of the IEEE • 1982
View 14 Excerpts
Highly Influenced

Fast Fourier Transforms: for fun and profit

AFIPS Fall Joint Computing Conference • 1966
View 14 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…