Publication: Solving the learning parity with noise's open question
Issued Date
2013-05-22
Resource Type
ISSN
00200190
Other identifier(s)
2-s2.0-84877859207
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
Information Processing Letters. Vol.113, No.14-16 (2013), 562-566
Suggested Citation
Vasin Suttichaya, Pattarasinee Bhattarakosol Solving the learning parity with noise's open question. Information Processing Letters. Vol.113, No.14-16 (2013), 562-566. doi:10.1016/j.ipl.2013.04.016 Retrieved from: https://repository.li.mahidol.ac.th/handle/20.500.14594/31643
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Solving the learning parity with noise's open question
Author(s)
Other Contributor(s)
Abstract
The classical cryptographic primitives are constructed on the assumptions that the private key is securely kept and uniformly distributed. Learning parity with noise is a famous problem used to construct several cryptographic primitives. This research studies the open question about the hardness of the learning parity with noise assumption when the secret vector is not uniform and has sufficient min-entropy. The proofs show that the standard learning parity with noise implies that it is secure even if the secret vector is sampled from an arbitrary distribution with sufficient entropy. Furthermore, this paper shows that the symmetric encryption scheme from learning parity with noise is secure even if the secret key has min-entropy at least k. © 2013 Elsevier B.V.