Random subcodes of classical Gabidulin codes enable LGS-Niederreiter schemes that achieve the smallest ciphertext sizes at 128-, 192-, and 256-bit security levels while keeping competitive public-key sizes.
List decodability of random subcodes of Gabidulin codes
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography
Random subcodes of classical Gabidulin codes enable LGS-Niederreiter schemes that achieve the smallest ciphertext sizes at 128-, 192-, and 256-bit security levels while keeping competitive public-key sizes.