A Note on the Sidelnikov-Shestakov Attack of Niederreiter Scheme
The terminology “code based public-key cryptosystem” means that the algorithmic primitives of such public-key cryptosystems use error correcting codes. In papers [1, 2] methods of building such public-key cryptosystems have been suggested. The Niederreiter’s public-key cryptosystem  based on q-ary generalized Reed-Solomon codes was proposed in 1986, Sidelnikov and Shestakov  presented an attack on this public-key cryptosystem in 1992, showing its insecurity. By examining the attack algorithm, we note that one can change some redundant procedures to simplify the algorithm.
KeywordsCode-based cryptography Niederreiter encryption GRS codes Sidelnikov-Shestakov attack
The authors would like to thank the anonymous reviewers of Inscrypt 2018 for their fruitful comments that improved the presentation of this note. This work has been partially supported by the Guangzhou University project (Project No. 2017GDJC-D04).
- 1.McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Deep space network progress report, 42–44, pp. 114–116 (1978)Google Scholar
- 4.Chen, L., Chen, L., Jordan, S., Liu, Y.-K., Moody, D., et al.: Report on post-quantum cryptography. Technical reports (2016). https://doi.org/10.6028/nist.ir.8105
- 9.Gabidulin, E.: Public-key cryptosystems based on linear codes. In: Proceedings of 4th IMA Conference on Cryptography and Coding 1993, Codes & Ciphers. IMA Press (1995)Google Scholar