Polynomial time attack on wild McEliece over quadratic extensions

Alain Couvreur; Ayoub Otmani; Jean Pierre Tillich

doi:10.1007/978-3-642-55220-5_2

Polynomial time attack on wild McEliece over quadratic extensions

Alain Couvreur
, Ayoub Otmani
, Jean Pierre Tillich

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.

Original language	English
Title of host publication	Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Publisher	Springer Verlag
Pages	17-39
Number of pages	23
ISBN (Print)	9783642552199
DOIs	https://doi.org/10.1007/978-3-642-55220-5_2
Publication status	Published - 1 Jan 2014
Event	33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2014 - Copenhagen, Denmark Duration: 11 May 2014 → 15 May 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8441 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2014
Country/Territory	Denmark
City	Copenhagen
Period	11/05/14 → 15/05/14

Keywords

cryptanalysis
filtration
public-key cryptography
wild McEliece cryptosystem

Access to Document

10.1007/978-3-642-55220-5_2

Cite this

Couvreur, A., Otmani, A., & Tillich, J. P. (2014). Polynomial time attack on wild McEliece over quadratic extensions. In Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 17-39). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8441 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-55220-5_2

Couvreur, Alain ; Otmani, Ayoub ; Tillich, Jean Pierre. / Polynomial time attack on wild McEliece over quadratic extensions. Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Springer Verlag, 2014. pp. 17-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b82e2ba5baa54421bf85791422cfcf34,

title = "Polynomial time attack on wild McEliece over quadratic extensions",

abstract = "We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.",

keywords = "cryptanalysis, filtration, public-key cryptography, wild McEliece cryptosystem",

author = "Alain Couvreur and Ayoub Otmani and Tillich, \{Jean Pierre\}",

year = "2014",

month = jan,

day = "1",

doi = "10.1007/978-3-642-55220-5\_2",

language = "English",

isbn = "9783642552199",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "17--39",

booktitle = "Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings",

note = "33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2014 ; Conference date: 11-05-2014 Through 15-05-2014",

}

Couvreur, A, Otmani, A & Tillich, JP 2014, Polynomial time attack on wild McEliece over quadratic extensions. in Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8441 LNCS, Springer Verlag, pp. 17-39, 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2014, Copenhagen, Denmark, 11/05/14. https://doi.org/10.1007/978-3-642-55220-5_2

Polynomial time attack on wild McEliece over quadratic extensions. / Couvreur, Alain; Otmani, Ayoub; Tillich, Jean Pierre.
Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Springer Verlag, 2014. p. 17-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8441 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Polynomial time attack on wild McEliece over quadratic extensions

AU - Couvreur, Alain

AU - Otmani, Ayoub

AU - Tillich, Jean Pierre

PY - 2014/1/1

Y1 - 2014/1/1

N2 - We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.

AB - We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.

KW - cryptanalysis

KW - filtration

KW - public-key cryptography

KW - wild McEliece cryptosystem

U2 - 10.1007/978-3-642-55220-5_2

DO - 10.1007/978-3-642-55220-5_2

M3 - Conference contribution

AN - SCOPUS:84901650553

SN - 9783642552199

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 17

EP - 39

BT - Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings

PB - Springer Verlag

T2 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2014

Y2 - 11 May 2014 through 15 May 2014

ER -

Couvreur A, Otmani A, Tillich JP. Polynomial time attack on wild McEliece over quadratic extensions. In Advances in Cryptology, EUROCRYPT 2014 - 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Springer Verlag. 2014. p. 17-39. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-55220-5_2

Polynomial time attack on wild McEliece over quadratic extensions

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this