Abstract
Recently [2] 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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H. Niederreiter, “Knapsack-Type Cryptosystem and Algebraic Coding Theory,” Probl.Control and Inform. Theory, vol.15, pp.19–34, 1986.
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.
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).
F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Company, New-York, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gabidulin, E.M., Kjelsen, O. (1994). How to avoid the Sidel'nikov-Shestakov attack. In: Chmora, A., Wicker, S.B. (eds) Error Control, Cryptology, and Speech Compression. ECCSP 1993. Lecture Notes in Computer Science, vol 829. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58265-7_4
Download citation
DOI: https://doi.org/10.1007/3-540-58265-7_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58265-6
Online ISBN: 978-3-540-48588-9
eBook Packages: Springer Book Archive