Reproduce “Information Loss Is All You Need: $TC^0$ Pseudorandomness from Worst-Case Lattices” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Chen Qian
The authors construct deterministic lattice-quotient labels and prove their security under worst-case lattice assumptions. The labels use blockwise rounding, while a proof-only affine transport reshapes errors and preserves exactly uniform public matrices. For one fixed parameter family, labels are pseudorandom for every polynomially many classical uniform examples against uniform quantum polynomial-time distinguishers; parameters are asymptotic, not practical.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.