Texonom
Texonom
/
Computing
Computing
/Computing Theory/Information Theory/Cryptography/
LWE
Search

LWE

Creator
Creator
Seonglae Cho
Created
Created
2024 Apr 17 10:56
Editor
Editor
Seonglae Cho
Edited
Edited
2024 Apr 17 11:22
Refs
Refs
Lattice Problem

Learning with errors problem (generalized LPN)

 
 
 

Oded Regev
2009

cims.nyu.edu
https://cims.nyu.edu/~regev/papers/qcrypto.pdf
Learning with errors
In cryptography, learning with errors (LWE) is a mathematical problem that is widely used to create secure encryption algorithms.[1] 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.[2] In more technical terms, it refers to the computational problem of inferring a linear n {\displaystyle n} -ary function f {\displaystyle f} over a finite ring from given samples y i = f ( x i ) {\displaystyle y_{i}=f(\mathbf {x} _{i})} some of which may be erroneous. The LWE problem is conjectured to be hard to solve,[1] and thus to be useful in cryptography.
Learning with errors
https://en.wikipedia.org/wiki/Learning_with_errors

Korean

coding.yonsei.ac.kr
http://coding.yonsei.ac.kr/201506-5.pdf
 
 

Table of Contents
Learning with errors problem (generalized LPN) 2009Korean

Recommendations

Texonom
Texonom
/
Computing
Computing
/Computing Theory/Information Theory/Cryptography/
LWE
Copyright Seonglae Cho