Name
Abstract | ||
|---|---|---|
An approach is proposed for the cryptanalysis of the well-known version of McEliece's public-key cryptosystem that is based on a new iterative optimization algorithm for decoding an arbitrary linear code. The algorithm provides guaranteed correction of all error patterns with Hamming weight less than d/2, where d is the minimum distance of the code, and has time complexity about O(n3) where n is the block length. The approach is illustrated by the cryptanalysis of McEliece's system when a (63, 36) binary code with d = 11 is the underlying linear code. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/3-540-46416-6_5 | EUROCRYPT |
Keywords | Field | DocType |
minimum distance,new iterative optimization algorithm,binary code,error pattern,hamming weight,public-key cryptosystem,time complexity,block length,underlying linear code,arbitrary linear code | Discrete mathematics,Higher-order differential cryptanalysis,Constant-weight code,Piling-up lemma,Computer science,Theoretical computer science,Code word,Goppa code,Linear code,Linear cryptanalysis,McEliece cryptosystem | Conference |
Volume | ISSN | ISBN |
547 | 0302-9743 | 3-540-54620-0 |
Citations | PageRank | References |
12 | 2.25 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Valery I. Korzhik | 1 | 35 | 15.45 |
| Andrey I. Turkin | 2 | 12 | 2.25 |