Information Set Decoding with Soft Information and some cryptographic applications

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceeding

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.

Detaljer

Författare
Enheter & grupper
Forskningsområden

Ämnesklassifikation (UKÄ) – OBLIGATORISK

  • Annan elektroteknik och elektronik
Originalspråkengelska
Titel på värdpublikationIEEE International Symposium on Information Theory (ISIT)
FörlagIEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor1793-1797
ISBN (elektroniskt)978-1-5090-4096-4
StatusPublished - 2017
PublikationskategoriForskning
Peer review utfördJa
Evenemang2017 IEEE International Symposium on Information Theory - Aachen, Tyskland
Varaktighet: 2017 jun 252017 jun 30
https://isit2017.org/

Konferens

Konferens2017 IEEE International Symposium on Information Theory
Förkortad titelISIT
LandTyskland
OrtAachen
Period2017/06/252017/06/30
Internetadress