Paper 2023/1049

Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method

Andrej Bogdanov, University of Ottawa
Pravesh Kothari, Carnegie Mellon University
Alon Rosen, Bocconi University and Reichman University

The low-degree method postulates that no efficient algorithm outperforms low-degree polynomials in certain hypothesis-testing tasks. It has been used to understand computational indistinguishability in high-dimensional statistics. We explore the use of the low-degree method in the context of cryptography. To this end, we apply it in the design and analysis of a new public-key encryption scheme whose security is based on Goldreich's pseudorandom generator. The scheme is a combination of two proposals of Applebaum, Barak, and Wigderson, and inherits desirable features from both.

Available format(s)
Public-key cryptography
Publication info
local pseudorandom generatorshypothesis testinglow-degree methodaverage-case hardness
Contact author(s)
abogdano @ uottawa ca
praveshk @ cs cmu edu
alon rosen @ unibocconi it
2023-07-05: approved
2023-07-05: received
See all versions
Short URL
No rights reserved


      author = {Andrej Bogdanov and Pravesh Kothari and Alon Rosen},
      title = {Public-Key Encryption, Local Pseudorandom Generators, and the Low-Degree Method},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1049},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.