How to avoid the Sidel'nikov-Shestakov attack
- 160 Downloads
Recently  Sidel'nikov and Shestakov showed how to break the Niederreiter Public-Key Cryptosystem. It is proposed to make breaking this PKC based on Generalized Reed-Solomon codes more difficult by randomizing the parity check matrix. The modified Niederreiter system appears to be secure.
KeywordsParity Check Parity Check Matrix Parity Check Matrice Legitimate Receiver Algebraic Code Theory
Unable to display preview. Download preview PDF.
- 1.H. Niederreiter, “Knapsack-Type Cryptosystem and Algebraic Coding Theory,” Probl.Control and Inform. Theory, vol.15, pp.19–34, 1986.Google Scholar
- 2.V.M. Sidelnikov and S.O. Shestakov, “On the Insecurity of Cryptosystems Based on Generalized Reed-Solomon Codes,” Discrete Math., vol. 1,no. 4, pp. 439–444, 1992.Google Scholar
- 3.V.M. Sidelnikov and S.O. Shestakov, “On the Cryptosystem Based on Generalized Reed-Solomon Codes,” in the Report Prospective Telecommunication and Integrated Communication Systems, Institute for Problems of Information Transmission, Russian Academy of Science, Moscow, 1992, pp. 48–61 (in Russian).Google Scholar
- 4.F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, New-York, 1977.Google Scholar