learning parity with noise 意思是：学习与噪声等值
learning parity with noise原理 Learning parity with noise (LPN) is a cryptographic problem that involves learning a secret vector known as the "parity bit" even when the communication is noisy. The problem assumes a communication channel that introduces random errors, making it challenging to ...
如果你年纪比较大,比如年纪比我大的话,你可能会知道一个困难问题,叫做Learning Parity with Noise问题。这个问题在1980年得到了些许关注,这是我能找到的最早的参考文献了,可能这个问题的提出时间要更早。密码学界对这个问题进行了一些研究,不过没研究多少。这几年,这个问题及其衍生问题有复苏的趋势。我想其中的原因是...
The Learning Parity with Noise (LPN) problem has recently found many applications in cryptography as the hardness assumption underlying the constructions of "provably secure" cryptographic schemes like encryption or authentication protoc... K Pietrzak - International Conference on Current Trends in Theory...
Learning Parity with Noise (LPN) is an attractive post-quantum cryptosystem for low-resource devices due to its simplicity. Communicating parties only require the use of AND and XOR gates to generate or verify LPN cryptogram samples exchanged between the parties. However, the LPN setup is complic...
专利名称：LEARNING PARITY WITH NOISE-BASED RELATIONAL ENCRYPTION FOR PROXIMITY RELATIONS 发明人：Avradip MANDAL,Arnab ROY,Hart MONTGOMERY 申请号：US15144713 申请日：20160502 公开号：US20170085379A1 公开日：20170323 专利内容由知识产权出版社提供 专利附图：摘要：A method includes receiving a first and a ...
摘要 The Learning Parity with Noise (LPN) problem is well understood in learning theory and cryptography and has been foun... 出版源 Springer International Publishing , 2016 关键词 Learning Parity with Noise / H...
Learning-with-Error 同样来自学习理论 (类似的还有 Learning-Parity-with-Noise, 但是 LPN 目前能构造...
The Learning Parity with Noise (LPN) problem has recently found many applications in cryptography as the hardness assumption underlying the constructions of “provably secure” cryptographic schemes like encryption or authentication protocols. Being...
Second, we give an algorithm for learning an unknown parity function on $k$ out of $n$ variables using $O(n^{1-1/k})$ examples in time polynomial in $n$. For $k=o(log n)$ this yields a polynomial time algorithm with sample complexity $o(n)$. This is the first polynomial ...