Live briefing
Everything about Learning with errors
Mathematical problem in cryptography
In cryptography, learning with errors (LWE) is a mathematical problem that is widely used to create secure encryption algorithms. It is based on the idea of representing secret information as a set of equations with errors. In other words, LWE is a way to hide the value of a secret by introducing noise to it. In more technical terms, it refers to the computational problem of inferring a linear -ary function over a finite ring from given samples some of which may be erroneous. The LWE problem is conjectured to be hard to solve, and thus to be useful in cryptography. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Learning with errorsA 5-minute orientation
- Skim a recent paper: Noisy Correspondence Learning with Self-Reinforcing Errors MitigationInfluential work since 2022
- Pick up a classic book: MacbethThe most-reprinted book on the subject
- Read the landmark paper: Detecting Errors with Zero-Shot LearningCited 8 times
- Go sideways: Ring learning with errors key exchangeA closely related topic
- Go sideways: Ring learning with errorsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Detecting Errors with Zero-Shot Learning
Discrimination reversal following learning without “errors”
Learning with Physical Noise or Errors
Representation learning with reward prediction errors
Learning with Errors from Nonassociative Algebras
LEARNING WITHOUT ERRORS
Learning with Errors
Rényi divergence on learning with errors
🆕 Influential since 2022
Noisy Correspondence Learning with Self-Reinforcing Errors Mitigation
Learning by teaching with deliberate errors promotes argumentative reasoning.
From learning with errors (LWE) problem to CLWE problem
Inner product encryption from Middle-Product Learning With Errors
Encrypted Control Using Modified Learning with Errors-based Schemes
📚 Books worth reading
MacbethWilliam Shakespeare · 1508
Gulliver's TravelsJonathan Swift · 1726
King LearWilliam Shakespeare · 1608
Julius CaesarWilliam Shakespeare · 1656
The PrinceNiccolò Machiavelli · 1515
Romeo and JulietWilliam Shakespeare · 1597
The Merchant of VeniceWilliam Shakespeare · 1600
Twelfth Night, or What You WillWilliam Shakespeare · 1734
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Ring learning with errors key exchange In cryptography, a public key exchange algorithm is a cryptographic algorithm which allows two parties to create and share a secret key, which they can…
- Ring learning with errors In post-quantum cryptography, ring learning with errors (RLWE) is a computational problem which serves as the foundation of new cryptographic algorithms…
- Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
- Lattice-based cryptography Lattice-based cryptography is the generic term for constructions of cryptographic primitives that involve lattices, either in the construction itself or…
- Ring learning with errors signature Digital signatures are a means to protect digital information from intentional modification and to authenticate the source of digital information. Public…
- Short integer solution problem Short integer solution (SIS) and ring-SIS problems are two average-case problems that are used in lattice-based cryptography constructions. Lattice-based…
- Oded Regev (computer scientist) Oded Regev (Hebrew: עודד רגב; born 1978) is an Israeli-American theoretical computer scientist and mathematician. He is a professor of computer science…
- Computational hardness assumption In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where…