On insecurity of cryptosystems based on generalized Reed-Solomon codes

Code Based Cryptography and Steganography

“…Once again, results show that Mc Eliece's cryptosystem gives better results compared to RSA but not compared to elliptic cryptosystems.. A smart card implementation (16 bits processor) is described in [102], ciphering and deciphering is done in less than 2 seconds for a 2048 code length. Hardware implementations of Mc Eliece's cryptosystem gave rise to several side channel attacks [103,98,66,27,80].…”

Applied cryptography: Protocols, algorithms, and source code in C

“…Their paper contained no evidence to substantiate their claim, and most cryptographers discount the result. Another Russian attack, one that cannot be used directly against the McEliece system, is in [1447,1448]. Extensions to McEliece can be found in [424,1227,976].…”

The non-gap sequence of a subcode of a generalized Reed–Solomon code

“…In its original paper [6] Niederreiter proposed the class of Generalized Reed-Solomon (GRS) codes over F 2 m . However, Sidelnikov and Shestakov in [8] introduced an algorithm that, in polynomial time, permits us to discover the structure of the secret GRS code used in the cryptosystem. Therefore, the initial Niederreiter scheme is completely broken.…”