A simple Python script to decode wild Goppa codes. The algorithm is described in detail in the article Wild McEliece.

See here: https://github.com/christianepeters/wild

A simple Python script to decode wild Goppa codes. The algorithm is described in detail in the article Wild McEliece.

See here: https://github.com/christianepeters/wild

**A brief look at the 56 SHA-3 submissions.** Joint “talk” by Michael Naehrig, Peter Schwabe, and me during the rump session of Eurocrypt 2009. Cologne, Germany. slides lyrics and chords youtube

The repository

https://bitbucket.org/cbcrypto/isdfq

contains a PARI/GP file for a crude operation count as well as a precise iteration count on the basis of a Markov-chain computation. The implementation is written in C and uses the MPFI library. Details on how to use the implementation can be found here.

Awarded to twenty-one selected female Ph.D. and Master students from Europe for excellence performance in computing and technology; I got 5,000 Euro. :-)

http://googleblog.blogspot.com/2009/05/announcing-2009-anita-borg-scholars-and.html

In June 2009 I went together with the other award winners to the Google Europe Anita Borg Scholarship Retreat in Zürich, Switzerland.

Iteration count of the improved variant of Stern’s algorithm for binary linear codes by Daniel J. Bernstein, Tanja Lange, and myself published at PQCrypto 2008.

Compute the iteration counts for our attack on the McEliece cryptosystem using the type-3 Markov-chain analysis.

https://github.com/christianepeters/isdf2

The implementation is written in C and uses the MPFI library. Note that you might need to increase the level of precision if you consider codes of length greater than 1024. Change the line

int prec = 150;

to something more convenient.

See also the post on ISDFq.

Wouldn’t it be great if we were able to threaten RSA using EECM?