Cryptanalysis of McEliece's public-key cryptosystem

Authors:
Valery I. Korzhik;Andrey I. Turkin
Affiliations:
Department of Communication Theory, Leningrad Electroengineering Institute of Communications, Leningrad, USSR;Computer Department, Gorky Polytechnical Institute, Nizhnii Novgorod, USSR
Venue:
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Year:
1991

Citing 0
Cited 2

Improving the Security of the McEliece Public-Key Cryptosystem

ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.