How to use the Fast Fourier Transform in Large Finite Fields
Petur Birgir Petersen
TL;DR
This paper discusses methods for applying the Fast Fourier Transform over large finite fields by exploiting the composite structure of their multiplicative groups, enabling more efficient computations.
Contribution
It introduces a novel approach to perform FFT in large finite fields by leveraging the composite nature of their multiplicative groups.
Findings
Enhanced efficiency in FFT computations over large finite fields
Utilization of composite group structures for algorithm optimization
Potential applications in cryptography and coding theory
Abstract
The article contents suggestions on how to perform the Fast Fourier Transform over Large Finite Fields. The technique is to use the fact that the multiplicative groups of specific prime fields are surprisingly composite.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptography and Residue Arithmetic · Advanced Wireless Communication Techniques