Representing hard lattices with O(n log n) bits

DOI10.1145/1060590.1060604zbMath1192.94087OpenAlexW2024697209MaRDI QIDQ3581417

Miklós Ajtai

Publication date: 16 August 2010

Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1060590.1060604

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (1)

Cryptographic Functions from Worst-Case Complexity Assumptions

This page was built for publication: Representing hard lattices with O(n log n) bits