How to avoid the Sidel'nikov-Shestakov attack
EM Gabidulin, O Kjelsen - Workshop on Information Protection, 1993 - Springer
EM Gabidulin, O Kjelsen
Workshop on Information Protection, 1993•SpringerAbstract 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.
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.
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.
Springer
Showing the best result for this search. See all results