@inproceedings{66a9174c423447fe928c83a683d8c070,

title = "Information-set decoding for linear codes over Fq",

abstract = "The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern's algorithm and its improvements are well optimized and the complexity is reasonably well understood. However, these algorithms only handle codes over F_2. This paper presents a generalization of Stern's information-set-decoding algorithm for decoding linear codes over arbitrary finite fields F_q and analyzes the complexity. This result makes it possible to compute the security of recently proposed code-based systems over non-binary fields. As an illustration, ranges of parameters for generalized McEliece cryptosystems using classical Goppa codes over F_31 are suggested for which the new information-set-decoding algorithm needs 2^128 bit operations.",

author = "C.P. Peters",

year = "2010",

doi = "10.1007/978-3-642-12929-2_7",

language = "English",

isbn = "978-3-642-12928-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "81--94",

editor = "N. Sendrier",

booktitle = "Post-Quantum Cryptography (3rd International Workshop, PQCrypto 2010, Darmstadt, Germany, May 25-28, 2010)",

address = "Germany",

}