Pages that link to "Item:Q1009035"
From MaRDI portal
The following pages link to Attacks and counter-attacks on the GPT public key cryptosystem (Q1009035):
Displaying 16 items.
- Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes (Q1647553) (← links)
- Improved cryptanalysis of rank metric schemes based on Gabidulin codes (Q1650811) (← links)
- Extension of Overbeck's attack for Gabidulin-based cryptosystems (Q1696047) (← links)
- Security analysis of a cryptosystem based on subspace subcodes (Q2163762) (← links)
- Structural attacks for public key cryptosystems based on Gabidulin codes (Q2425529) (← links)
- Modified Niederreiter type of GPT cryptosystem based on reducible rank codes (Q2436558) (← links)
- Modified GPT PKC with right scrambler (Q2741406) (← links)
- A Novel Niederreiter-like cryptosystem based on the (<i>u</i>|<i>u</i> + <i>υ</i>)-construction codes (Q5021116) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals (Q6111575) (← links)
- Distinguishing and recovering generalized linearized Reed-Solomon codes (Q6132742) (← links)
- McEliece-type encryption based on Gabidulin codes with no hidden structure (Q6134010) (← links)
- LowMS: a new rank metric code-based KEM without ideal structure (Q6489787) (← links)
- On the rank decoding problem over finite principal ideal rings (Q6584334) (← links)
- Two modifications for Loidreau's code-based cryptosystem (Q6602397) (← links)
- Injective rank metric trapdoor functions with homogeneous errors (Q6619843) (← links)