International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 27 May 2013

I. V. Chizhov, M. A. Borodin
ePrint Report ePrint Report
This paper describes new algorithm for breaking McEliece cryptosystem, built on Reed-Muller binary code $RM(r, m)$, which receives the private key from the public key. The algorithm has complexity $O(n^d+n^4log_2n)$ bit operations, where $n=2^m, d=\\text{GCD}(r,m-1).$ In the case of $\\text{GCD}(r,m-1)$ limitation, attack has polynomial complexity. Practical results of implementation show that McEliece cryptosystems, based on the code with length $n=65536$ bits, can be broken in less than 7 hours on a personal computer.

Expand

Additional news items may be found on the IACR news page.