@conference {15134, title = {Efficient cryptographic protocols based on the hardness of learning parity with noise}, booktitle = {Proceedings of the 11th IMA international conference on Cryptography and coding}, series = {Cryptography and Coding{\textquoteright}07}, year = {2007}, month = {2007///}, pages = {1 - 15}, publisher = {Springer-Verlag}, organization = {Springer-Verlag}, address = {Berlin, Heidelberg}, abstract = {The problem of learning parity with noise (The LPN problem), which can be re-cast as the problem of decoding a random linear code, has attracted attention recently as a possible tool for developing highly-efficient cryptographic primitives suitable for resource-constrained devices such as RFID tags. This article surveys recent work aimed at designing efficient authentication protocols based on the conjectured hardness of this problem.}, isbn = {3-540-77271-5, 978-3-540-77271-2}, url = {http://dl.acm.org/citation.cfm?id=1782574.1782576}, author = {Katz, Jonathan} }