Information Set Decoding with Soft Information and some cryptographic applications

Qian Guo; Thomas Johansson; Erik Mårtensson; Paul Stankovski

doi:10.1109/ISIT.2017.8006838

Information Set Decoding with Soft Information and some cryptographic applications

Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

Sammanfattning

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.

Originalspråk	engelska
Titel på värdpublikation	IEEE International Symposium on Information Theory (ISIT)
Förlag	IEEE - Institute of Electrical and Electronics Engineers Inc.
Sidor	1793-1797
ISBN (elektroniskt)	978-1-5090-4096-4
DOI	https://doi.org/10.1109/ISIT.2017.8006838
Status	Published - 2017
Evenemang	2017 IEEE International Symposium on Information Theory - Aachen, Tyskland Varaktighet: 2017 juni 25 → 2017 juni 30 https://isit2017.org/

Konferens

Konferens	2017 IEEE International Symposium on Information Theory
Förkortad titel	ISIT
Land/Territorium	Tyskland
Ort	Aachen
Period	2017/06/25 → 2017/06/30
Internetadress	https://isit2017.org/

Ämnesklassifikation (UKÄ)

Annan elektroteknik och elektronik

Tillgång till dokument

10.1109/ISIT.2017.8006838

Citera det här

@inproceedings{b037b8ba82824725b2a510722080521d,

title = "Information Set Decoding with Soft Information and some cryptographic applications",

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.",

author = "Qian Guo and Thomas Johansson and Erik M{\aa}rtensson and Paul Stankovski",

year = "2017",

doi = "10.1109/ISIT.2017.8006838",

language = "English",

pages = "1793--1797",

booktitle = "IEEE International Symposium on Information Theory (ISIT)",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "2017 IEEE International Symposium on Information Theory, ISIT ; Conference date: 25-06-2017 Through 30-06-2017",

url = "https://isit2017.org/",

}

Guo, Q , Johansson, T , Mårtensson, E & Stankovski, P 2017, Information Set Decoding with Soft Information and some cryptographic applications. i IEEE International Symposium on Information Theory (ISIT). IEEE - Institute of Electrical and Electronics Engineers Inc., s. 1793-1797, 2017 IEEE International Symposium on Information Theory, Aachen, Tyskland, 2017/06/25. https://doi.org/10.1109/ISIT.2017.8006838

Information Set Decoding with Soft Information and some cryptographic applications. / Guo, Qian ; Johansson, Thomas ; Mårtensson, Erik et al.

IEEE International Symposium on Information Theory (ISIT). IEEE - Institute of Electrical and Electronics Engineers Inc., 2017. s. 1793-1797.

Forskningsoutput: Kapitel i bok/rapport/Conference proceeding › Konferenspaper i proceeding › Peer review

TY - GEN

T1 - Information Set Decoding with Soft Information and some cryptographic applications

AU - Guo, Qian

AU - Johansson, Thomas

AU - Mårtensson, Erik

AU - Stankovski, Paul

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2017.8006838

DO - 10.1109/ISIT.2017.8006838

M3 - Paper in conference proceeding

SP - 1793

EP - 1797

BT - IEEE International Symposium on Information Theory (ISIT)

PB - IEEE - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE International Symposium on Information Theory

Y2 - 25 June 2017 through 30 June 2017

ER -

Information Set Decoding with Soft Information and some cryptographic applications

Sammanfattning

Konferens

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här