Algorithm for recovering plaintext from ciphertext in Mceliece cryptosystem
An attack on McEiece cryptosystem is considered. In it a plaintext is recovered from a ciphertext by solving the encryption equation. The solution is get in two steps: finding the error vector and solving the system of linear equations. For finding the error vector, the Bernstein — Lange — Peters's algorithm is used together with some optimization techniques. The complexity of the offered attack on the cryptosystem based on Goppa (1024, 524, 50)-code equals 2 ' bit operations that is 27,5% less than by means of Bernstein — Lange — Peters's algorithm itself.
Download file
Counter downloads: 288
Keywords
криптосистема Мак-Элиса, неструктурные атаки, алгоритм Бернштейна — Ланг —Петерса, алгоритм Шабо — Канто, McEliece's cryptosystem, nonstructural attacks, Bernstein — Lange — Peters's algorithmAuthors
| Name | Organization | |
| Kaluzhin A.K. | Lomonosov Moscow State University | alexskorp@yandex.ru |
| Chizhov I. V. | Lomonosov Moscow State University | ivchizhov@gmail.com |
References
McEliece R. J. A public-key cryptosystem based on algebraic coding theory // DSN Progress Report. January and February 1978. No. 42-44. P. 114-116.
Finiasz M. and Sendrier N. Security bounds for the design of code-based cryptosystems // Asiacrypt'2009. LNCS. 2009. V. 5912. P. 88-105.
Bernstein D. J., Lange T., and Peters C. Attacking and defending the McEliece cryptosystem // Post-Quantum Cryptography: Second International Workshop, PQCrypto 2008. Cincinnaty, OH, USA. October 17-19, 2008. P. 31-46.
