ScholarLens Back to search
2013•Unpublished venueRequires access

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

Ivan Chizhov, М. А. Бородин

Open publisher page 11 citations

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 4 log2n) bit operations, where n = 2 m, d = GCD(r, m−1). In the case of 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. 1

About this research paper

What this paper is about

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 4 log2n) bit operations, where n = 2 m, d = GCD(r, m−1). In the case of 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. 1

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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 4 log2n) bit operations, where n = 2 m, d = GCD(r, m−1). In the case of 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. 1

Key concepts: McEliece cryptosystem, Public key cryptosystem, Cryptosystem, Code (set theory), Public-key cryptography, Arithmetic, Computer science, Binary number

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
The failure of McEliece PKC based on Reed-Muller codes. — Research Paper | ScholarLens