Reproduce “Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Freddy Lendé Metouké, Hervé Talé Kalachi, Hermann Tchatchiem Kamche, Ousmane Ndiaye, Sélestin Ndjeya
Researchers investigated subcodes of lambda-Gabidulin codes, demonstrating that while structured subcodes retain algebraic invariants, randomly constructed F_q-linear subcodes can mitigate structural attacks. This led to the LGS-Niederreiter cryptosystem, which achieves very compact ciphertexts, such as 40 B for 128-bit security, with competitive public-key sizes.
Key insights
- Even F_q-linear subcodes derived from structured lambda-Gabidulin codes (e.g., subspace subcodes) retain significant, detectable algebraic invariants in their expanded matrix images.
- The use of q-polynomials provides an explicit algebraic description of Gabidulin subspace subcodes, highlighting their strong inherent structure.
- Randomly constructed F_q-linear subcodes, generated via a specific matrix transformation, can effectively mask algebraic structure, leading to codes that appear indistinguishable from random matrix codes.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.