The polynomial learning with errors problem and the smearing condition
DOI10.1515/jmc-2020-0035OpenAlexW3049177476MaRDI QIDQ2168804
Aaron Kirtland, Liljana Babinkostova, Ariana Chin, Esther Plotnick, Vladyslav Nazarchuk
Publication date: 26 August 2022
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.04459
latticescoupon collector's problemsmearinglearning with errorsring learning with errorspolynomial learning with errors
Foundations and philosophical topics in statistics (62A01) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Miscellaneous applications of number theory (11Z05) Structure theory of lattices (06B05) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ring-LWE cryptography for the number theorist
- Large modulus ring-LWE \(\geq \) module-LWE
- Error analysis of weak poly-LWE instances
- Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
- Mathematics of Public Key Cryptography
- Pseudorandom Functions and Lattices
- Lattice Cryptography for the Internet
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Provably Weak Instances of Ring-LWE
- On Ideal Lattices and Learning with Errors over Rings
- Lattice-based Cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: The polynomial learning with errors problem and the smearing condition
