Paper 2014/360
McEliece in the world of Escher
Danilo Gligoroski, Simona Samardjiska, Håkon Jacobsen, and Sergey Bezzateev
Abstract
We present a new family of linear binary codes of length n and dimension k accompanied with a fast list decoding algorithm that can correct up to n/2 errors in a bounded channel with an error density
Note: The same material as previously, but restructured in a form of monograph. The cheap distinguisher attack section is updated to cover signatures.
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Public KeyCryptographyMcEliece PKCError Correcting CodesList Decoding
- Contact author(s)
-
danilog @ item ntnu no
simonas @ item ntnu no
hakoja @ item ntnu no
bsv @ aanet ru - History
- 2014-09-24: last of 4 revisions
- 2014-05-23: received
- See all versions
- Short URL
- https://ia.cr/2014/360
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/360, author = {Danilo Gligoroski and Simona Samardjiska and Håkon Jacobsen and Sergey Bezzateev}, title = {{McEliece} in the world of Escher}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/360}, year = {2014}, url = {https://eprint.iacr.org/2014/360} }