How to avoid the Sidel'nikov-Shestakov attack

DOI10.1007/3-540-58265-7_4MaRDI QIDQ4637800zbMATH OpenOpenAlexFDO

Authors Olaf Kjelsen, E. M. Gabidulin

Publication date 26 April 2018

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58265-7_4

zbMATH Keywords

generalized Reed-Solomon codesNiederreiter Public-Key Cryptosystemrandomization of parity check matrix

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A note on the Sidelnikov-Shestakov attack of Niederreiter scheme
• Public Key Cryptography - PKC 2006
• Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes
• On the edge-independence number and edge-covering number for regular graphs
• Attacking and Defending the McEliece Cryptosystem

Cites work

• scientific article; zbMATH DE number 3983072 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• On the edge-independence number and edge-covering number for regular graphs

Cited in

(11)

• The non-gap sequence of a subcode of a generalized Reed-Solomon code
• On the decipherment of Sidel'nikov-type cryptosystems
• A note on the Sidelnikov-Shestakov attack of Niederreiter scheme
• Cryptanalyzing the polynomial-reconstruction based public-key system under optimal parameter choice
• Enhanced public key security for the McEliece cryptosystem
• Square code attack on a modified Sidelnikov cryptosystem
• Niederreiter public-key cryptosystem based on QC-LDPC
• A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
• Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
• Cryptanalysis of the Sidelnikov Cryptosystem
• Public Key Cryptography - PKC 2006

This page was built for publication: How to avoid the Sidel'nikov-Shestakov attack

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637800)