The authors found that there exists an efficient quantum learning algorithm with polynomial sample and time complexity for a learning problem. As the authors have concluded, the results have some implications fo
On lattices, learning with errors, random linear codes, and cryptography | Proceedings of the thirty-seventh annual ACM symposium on Theory of computingAbstractmain result:a reduction from worst-ca…
文献学习-On Lattices, Learning with Errors,Random Linear Codes, and Cryptography A main open question is whether this reduction can be made classical. 主要成果:一个从最坏情况下的格问题(如SVP\SIVP)到一类学习性问题的归约。这类学习性问题是learning from parity with error(从奇偶错误校验中自学习?
Summary: The Snowden revelations have shown that intelligence agencies have been successful in undermining cryptography and put in question the exact security provided by the underlying intractability problem. We introduce a new class of intractability problems, called Learning with Errors in the Exponent...
需要金币:*** 金币(10金币=人民币1元) On Lattices, Learning with Errors, Random Linear Codes, and Cryptography:(格,学习错误,随机线性编码和加密).pdf 关闭预览 想预览更多内容,点击免费在线预览全文 免费在线预览全文 On Lattices, Learning with Errors, Random Linear Codes, and Cryptography:(格,学习错...
OnLattices,LearningwithErrors, RandomLinearCodes,andCryptography OdedRegev ∗ September8,2007 Abstract Ourmainresultisareductionfromworst-caselatticeproblemssuchasSVPandSIVPtoacertain learningproblem.Thislearningproblemisanaturalextensionofthe‘learningfromparitywitherror’ problemtohighermoduli.Itcanalsobeviewedas...
On Lattices, Learning with Errors, Random Linear Codes, and Cryptography Oded Regev ? May 2, 2009 Abstract Our main result is a reduction from worst-case lattice problems such as G AP SVP and SIVP to a certain learning problem. This learning problem is a natural extension of the ‘learning...
This work shows that non-black-box techniques are not necessary for basic laconic cryptography primitives. We propose a completely algebraic construction of laconic encryption, a notion that we introduce in this work, which serves as the cornerstone of our framework. We prove that the scheme is ...
Lattice-based cryptography relies in great parts on the assumed hardness of two well-studied and closely related problems: the Small Integer Solution problem (SIS) introduced in [Ajt96] and the Learning With Errors problem (LWE) introduced in [Reg09]. They lead to numerous cryptographic construct...
On Ideal Lattices and Learning with Errors over Rings cryptographyquantum computationpublic key encryptionaverage-case hardnessThe "learning with errors" (LWE) problem is to distinguish random linear equations, ... VADIM LYUBASHEVSKY,CHRIS PEIKERT,ODED REGEV - 《Journal of the Association for Computing...