Polynomial Time Attack on Wild McEliece Over Quadratic Extensions Alain Couvreur1 , Ayoub Otmani2 , and Jean–Pierre Tillich3

First Page		Document Content
Date: 2014-02-13 14:34:46 Mathematics Goppa code Alternant code McEliece cryptosystem Reed–Solomon error correction Linear code Reed–Muller code Algebraic geometry Coding theory Finite fields Error detection and correction		Polynomial Time Attack on Wild McEliece Over Quadratic Extensions Alain Couvreur1 , Ayoub Otmani2 , and Jean–Pierre Tillich3 Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 439,78 KB Share Document on Facebook

	Code-based Cryptography Christiane Peters Technical University of Denmark ECC 2011 DocID: 1n4uc - View Document
	Differential Power Analysis of a McEliece Cryptosystem Cong Chen1 , Thomas Eisenbarth1 , Ingo von Maurich2 , and Rainer Steinwandt3 1 Worcester Polytechnic Institute, Worcester, MA, USA DocID: 1ldPH - View Document
	An efficient attack of a McEliece cryptosystem variant based on convolutional codes Gregory Landais Jean-Pierre Tillich DocID: 1kCqr - View Document
	Semantic Security for the McEliece Cryptosystem without Random Oracles Ryo Nojima1 , Hideki Imai23 , Kazukuni Kobara3 , and Kirill Morozov3 1 National Institute of Information and Communications Technology (NICT), Japan DocID: 1eRpV - View Document
	Semantic Security for the McEliece Cryptosystem without Random Oracles Ryo Nojima1 , Hideki Imai23 , Kazukuni Kobara3 , and Kirill Morozov3 1 National Institute of Information and Communications Technology (NICT), Japan DocID: 1e3Vt - View Document