Welcome to the resource topic for 2013/287
Title:
The failure of McEliece PKC based on Reed-Muller codes.
Authors: I. V. Chizhov, M. A. Borodin
Abstract: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.
ePrint: https://eprint.iacr.org/2013/287
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .