Annual International Cryptology Conference

CRYPTO 1997: Advances in Cryptology — CRYPTO '97 pp 213-220

Failure of the McEliece public-key cryptosystem under message-resend and related-message attack

  • Thomas A. Berson
Conference paper

DOI: 10.1007/BFb0052237

Volume 1294 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Berson T.A. (1997) Failure of the McEliece public-key cryptosystem under message-resend and related-message attack. In: Kaliski B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg

Abstract

The McEliece public-key cryptosystem fails to protect any message which is sent to a recipient more than once using different random error vectors. In general, it fails to protect any messages sent to a recipient which have a known linear relation to one another. Under these conditions, which are easily detectable, the cryptosystem is subject to a devastating attack which reveals plaintext with a work factor which is 1015 times better than the best general attack.

Keywords

McEliece public-key cryptosystem randomization error-correcting codes error vectors message-resend attack related-message attack protocol failure cryptanalysis 
Download to read the full conference paper text

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Thomas A. Berson
    • 1
  1. 1.Anagram LaboratoriesPalo AltoUSA