How to avoid the Sidel'nikov-Shestakov attack

DOI10.1007/3-540-58265-7_4zbMath1384.94062OpenAlexW1542865108MaRDI QIDQ4637800

Olaf Kjelsen, Ernst 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)

Related Items (2)

Enhanced public key security for the McEliece cryptosystem ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory

Cites Work

• Unnamed Item
• Unnamed Item
• On the edge-independence number and edge-covering number for regular graphs

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