The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Solving LPN Using Covering Codes

På svenska

Author

Editor

  • Tetsu Iwata
  • Palash Sarkar

Summary, in English

We present a new algorithm for solving the LPN problem. The algorithm has a similar form as some previous methods, but includes a new key step that makes use of approximations of random words to a nearest codeword in a linear code. It outperforms previous methods for many parameter choices. In particular, we can now solve instances suggested for 80-bit security in cryptographic schemes like HB variants, LPN-C and Lapin, in less than 2(80) operations.

Publishing year

2014

Language

English

Pages

1-20

Publication/Series

Advances in Cryptology - Asiacrypt 2014

Volume

8873

Document type

Conference paper

Publisher

Springer

Topic

  • Computer Science

Conference name

20th Annual International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt)

Conference date

2014-12-07 - 2014-12-11

Conference place

Kaohsiung, Taiwan

Status

Published

ISBN/ISSN/Other

  • ISSN: 0302-9743
  • ISSN: 1611-3349
  • ISBN: 978-3-662-45610-1