Iteration count for ISDFq attack

My paper Information-set decoding for linear codes over Fq presents a new algorithm for decoding linear codes over arbitrary finite fields Fq.

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.

Advertisements