The polynomial learning with errors problem and the smearing condition
DOI10.1515/JMC-2020-0035OpenAlexW3049177476MaRDI QIDQ2168804FDOQ2168804
Authors: L. Babinkostova, Ariana Chin, Aaron Kirtland, Vladyslav Nazarchuk, Esther Plotnick 
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
latticeslearning with errorscoupon collector's problemsmearingring learning with errorspolynomial learning with errors
Foundations and philosophical topics in statistics (62A01) Structure theory of lattices (06B05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Quantum cryptography (quantum-theoretic aspects) (81P94) Miscellaneous applications of number theory (11Z05)
Cites Work
- Title not available (Why is that?)
- On ideal lattices and learning with errors over rings
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- On lattices, learning with errors, random linear codes, and cryptography
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Mathematics of public key cryptography.
- Better key sizes (and attacks) for LWE-based encryption
- Lattice-based Cryptography
- Title not available (Why is that?)
- Pseudorandom Functions and Lattices
- Large modulus ring-LWE \(\geq \) module-LWE
- Lattice Cryptography for the Internet
- Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)
- Provably Weak Instances of Ring-LWE
- Ring-LWE cryptography for the number theorist
- Error analysis of weak poly-LWE instances
Cited In (1)
This page was built for publication: The polynomial learning with errors problem and the smearing condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168804)
