Abstract
The class of information set decoding algorithms is the best known way of decoding general codes, i.e. codes that admit no special structure, in the Hamming metric. Stern's algorithm is the origin of the most efficient algorithms in this class. In this paper we consider the same decoding problem but for a channel with soft information. We give a version of Stern's algorithm for a channel with soft information that includes some novel steps of ordering vectors in lists, based on reliability values. We then demonstrate how this new algorithm can be used in a few cryptographic applications, including a very efficient attack on a recently proposed McEliece-type cryptosystem.
| Original language | English |
|---|---|
| Title of host publication | IEEE International Symposium on Information Theory (ISIT) |
| Publisher | IEEE - Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1793-1797 |
| ISBN (Electronic) | 978-1-5090-4096-4 |
| DOIs | |
| Publication status | Published - 2017 |
| Event | 2017 IEEE International Symposium on Information Theory - Aachen, Germany Duration: 2017 Jun 25 → 2017 Jun 30 https://isit2017.org/ |
Conference
| Conference | 2017 IEEE International Symposium on Information Theory |
|---|---|
| Abbreviated title | ISIT |
| Country/Territory | Germany |
| City | Aachen |
| Period | 2017/06/25 → 2017/06/30 |
| Internet address |
Subject classification (UKÄ)
- Other Electrical Engineering, Electronic Engineering, Information Engineering