Published by the Department of Computer Science, The University of Chicago.

Abstract

Ideas from Fourier analysis have been used in cryptography for the last three decades. Akavia, Goldwasser and Safra unified some of these ideas to give a complete algorithm that finds significant Fourier coefficients of functions on any finite abelian group. Their algorithm stimulated a lot of interest in the cryptography community, especially in the context of ``bit security''. This paper attempts to be a friendly and comprehensive guide to the tools and results in this field. The intended readership is cryptographers who have heard about these tools and seek an understanding of their mechanics and their usefulness and limitations. A compact overview of the algorithm is presented with emphasis on the ideas behind it. We show how these ideas can be extended to a ``modulus-switching'' variant of the algorithm. We survey some applications of this algorithm, and explain that several results should be taken in the right context. In particular, we point out that some of the most important bit security problems are still open. Our original contributions include: a discussion of the limitations on the usefulness of these tools; an answer to an open question about the modular inversion hidden number problem.

• The article: PDF (388 KB)
• Source material: ZIP (126 KB)
• BibTeX entry for this article (323 bytes)

Submitted July 25, 2016, revised March 5, 2018, and December 13, 2018, published December 20, 2018.

© 2018 Steven D. Galbraith, Joel Lait, and Barak Shani
Licensed under a Creative Commons Attribution License

Volume 2018, Article 5

Volume 2019, Article 1

Volume 2018

Published articles