Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
From MaRDI portal
Publication:2436558
Recommendations
Cites work
- Attacks and counter-attacks on the GPT public key cryptosystem
- scientific article; zbMATH DE number 3983072 (Why is no real title available?)
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- Progress in Cryptology – Mycrypt 2005
- Reducible rank codes and their applications to cryptography
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- Structural attacks for public key cryptosystems based on Gabidulin codes
- The security of the Gabidulin public key cryptosystem
- Theory of codes with maximum rank distance
Cited in
(6)- Column scrambler for the GPT cryptosystem
- Modified GPT PKC with right scrambler
- Reducible rank codes and their applications to cryptography
- scientific article; zbMATH DE number 2154106 (Why is no real title available?)
- A novel Niederreiter-like cryptosystem based on the \((u|u + \upsilon)\)-construction codes
- Progress in Cryptology - INDOCRYPT 2004
This page was built for publication: Modified Niederreiter type of GPT cryptosystem based on reducible rank codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436558)