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: A Construction of Three Party Post Quantum Secure Authenticated Key Exchange Using Ring Learning With Errors and ECC CryptographyInfluential work since 2022
- Pick up a classic book: A New EarthThe most-reprinted book on the subject
- Read the landmark paper: Multiparty Homomorphic Encryption from Ring-Learning-with-ErrorsCited 127 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)
Multiparty Homomorphic Encryption from Ring-Learning-with-Errors
Non-commutative Ring Learning with Errors from Cyclic Algebras
An Anti-Quantum Authentication Protocol for Space Information Networks Based on Ring Learning with Errors
Shorter Linkable Ring Signature Based on Middle-Product Learning with Errors Problem
Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography
On the security of the multivariate ring learning with errors problem
SLAP: Simpler, Improved Private Stream Aggregation from Ring Learning with Errors
Ring learning with errors: a crossroads between post-quantum cryptography, machine learning and number theory
🆕 Influential since 2022
A Construction of Three Party Post Quantum Secure Authenticated Key Exchange Using Ring Learning With Errors and ECC Cryptography
A Ring Learning with Errors-Based Ciphertext-Policy Attribute-Based Proxy Re-Encryption Scheme for Secure Big Data Sharing in Cloud Environment
CIDER: Cyber‐Security in Industrial IoT Using Deep Learning and Ring Learning with Errors
On the Security of Group Ring Learning with Errors
Cryptography with the Ring-LWE (Learning With Errors) Algorithm
📚 Books worth reading
A New EarthEckhart Tolle · 2005
Bulletin of the United States Army Medical DepartmentUnited States. Army Medical Service. · 1944
Think Like a FreakSteven D. Levitt, Stephen J. Dubner · 2014
Winsor McCayWinsor McCay · 2003
The Conspirators HierarchyJohn Coleman · 1992
The light of the Cross in the twentieth centuryJames Gibbons · 1905
Information anxietyRichard Saul Wurman · 1989
Emerging Technologies for Information Systems, Computing, and ManagementW. Eric Wong · 2013
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…