Information Set Decoding with Soft Information and some cryptographic applications

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding


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.


Research areas and keywords

Subject classification (UKÄ) – MANDATORY

  • Other Electrical Engineering, Electronic Engineering, Information Engineering
Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory (ISIT)
PublisherIEEE--Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)978-1-5090-4096-4
StatePublished - 2017
Publication categoryResearch
Event2017 IEEE International Symposium on Information Theory - Aachen, Germany
Duration: 2017 Jun 252017 Jun 30


Conference2017 IEEE International Symposium on Information Theory
Abbreviated titleISIT
Internet address