The polynomial learning with errors problem and the smearing condition

DOI10.1515/JMC-2020-0035MaRDI QIDQ2168804zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2008.04459

zbMATH Keywords

latticeslearning with errorscoupon collector's problemsmearingring learning with errorspolynomial learning with errors

Mathematics Subject Classification ID

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)

Recommendations

• Problem of learning with errors and modern cryptosystems
• Further improvements of the estimation of key enumeration with applications to solving LWE
• scientific article; zbMATH DE number 6823399
• Post-quantum insecurity from LWE
• On Quantum Chosen-Ciphertext Attacks and Learning with Errors

Cites work

• scientific article; zbMATH DE number 3167451 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Adaptively secure multi-party computation from LWE (via equivocal FHE)
• Better key sizes (and attacks) for LWE-based encryption
• Error analysis of weak poly-LWE instances
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Large modulus ring-LWE \(\geq \) module-LWE
• Lattice cryptography for the internet
• Lattice-based Cryptography
• Mathematics of public key cryptography.
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Provably weak instances of Ring-LWE
• Pseudorandom functions and lattices
• Ring-LWE cryptography for the number theorist

Cited in

(1)

• The Polynomial Learning With Errors Problem and the Smearing Condition

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)