On the McEliece Public-Key Cryptosystem

  • Johan van Tilburg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 403)


Based on an idea by Hin, the method of obtaining the original message after selecting k of n coordinates at random in the McEliece public-key cryptosystem is improved. The attack, which is more efficient than the attacks previously proposed, is characterized by a systematic method of checking and by a random bit swapping procedure. An optimization procedure similar to the one proposed by Lee and Brickell is used to improve the attack. The attack is highly suitable for parallel and pipelined implementation. The work factor and the values, which yield ‘maximum’ security for the system are given.

It is shown that the public-key can be reduced to k × (nk) bits.

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Johan van Tilburg
    • 1
  1. 1.Department of Applied MathematicsDr. Neher LaboratoriesLeidschendamthe Netherlands

Personalised recommendations