You are looking at a specific version 20130523:162149 of this paper. See the latest version.

Paper 2013/287

The failure of McEliece PKC based on Reed-Muller codes.

I. V. Chizhov and 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.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Reed-Muller binary codeMcEliece cryptosystem
Contact author(s)
bor1m @ mail ru
History
2013-10-09: revised
2013-05-23: received
See all versions
Short URL
https://ia.cr/2013/287
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.