The failure of Mceliece PKC based on Reed — Muller codes | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2013. № 6 (Приложение).

This paper describes new algorithm for breaking McEliece cryptosystem, being built on Reed — Muller binary code RM(r, m).The algorithm calculates the private key from the public key using O(n + n log n) bit operations, where n = 2 , d = (r, m — 1). In case of limited d, the attack has a polynomial complexity. Practical results of implementation show that McEliece cryptosystems, based on the Reed — Muller binary code of length n = 65526 bits, can be broken in less than 7 hours on a personal computer.