Polynomial Time Attack on Wild McEliece over Quadratic Extensions

DOI10.1007/978-3-642-55220-5_2zbMath1326.94134arXiv1402.3264OpenAlexW2586042870WikidataQ62039166 ScholiaQ62039166MaRDI QIDQ5418687

Jean-Pierre Tillich, Alain Couvreur, Ayoub Otmani

Publication date: 27 May 2014

Published in: Advances in Cryptology – EUROCRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3264

zbMATH Keywords

filtrationcryptanalysispublic-key cryptographywild McEliece cryptosystem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Algebraic field extensions (12F05) Cryptography (94A60) Combinatorial codes (94B25)

Related Items (4)

Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes ⋮ Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes ⋮ Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes ⋮ Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$

Uses Software

• Magma
• McEliece

This page was built for publication: Polynomial Time Attack on Wild McEliece over Quadratic Extensions