On lower bounds for Information Set Decoding over F_q

Code-based cryptosystems are promising candidates for post-quantum cryptography. The increasing number of cryptographic schemes that are based on codes over fields different from F_2 requires an analysis of their security. Information Set Decoding (ISD) is one of the most important generic attacks against code-based cryptosystems. We give lower bounds for ISD over F_q, thereby anticipating future software and hardware improvements. Our results allow to compute conservative parameters for cryptographic applications.