Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography

• URL: http://arxiv.org/abs/2604.18282v1
• Date: Mon, 20 Apr 2026 13:54:56 GMT
• Title: Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography
• Abstract summary: We first analyze subcodes ofcipher-Gabidulin codes and relate them to corresponding subcodes of classical Gabidulin codes.<n>When the extension degree equals the code length, we characterize Gabidulin subspace subcodes in terms of linearized relations.<n>Motivated by these results, we propose a generator-matrix-based construction of random subcodes designed to avoid such invariants.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper investigates subcodes of lambda-Gabidulin codes, viewed as rank-metric analogues of generalized Reed--Solomon codes, and their applications to compact-ciphertext cryptosystems. We first analyze subspace and generalized subspace subcodes of lambda-Gabidulin codes and relate them to corresponding subcodes of classical Gabidulin codes through coordinate-wise scaling. This relation yields cardinality bounds and structural properties for these families. When the extension degree equals the code length, we further characterize Gabidulin subspace subcodes in terms of linearized polynomials, which gives an explicit description of their encoding and dimension. We also study the matrix images of these subcodes over the base field through their stabilizer and annihilator algebras, showing that subspace restrictions may preserve nontrivial algebraic invariants despite the loss of extension-field linearity. Motivated by these results, we propose a generator-matrix-based construction of random subcodes designed to avoid such invariants. This construction is then used to design McEliece-like and Niederreiter-like encryption schemes in the MinRank setting. Among the parameter sets considered in this work, the most compact ciphertexts are obtained from random subcodes of classical Gabidulin codes. At the 128-, 192-, and 256-bit security levels, the resulting $\mathsf{LGS}$-Niederreiter instances achieve the smallest ciphertext sizes among the compared schemes, while maintaining competitive public-key sizes.

Related papers

• Quantum low-density lattice codes [0.0]
  Gottesman-Kitaev-Preskill (GKP) codes provide a family of promising schemes for encoding discrete quantum information (qudits) into infinite-dimensional bosonic modes based on mathematical lattices.<n>This paper presents a strategy of co-designing the decoder and the quantum error-correcting code itself by constructing lattices for which decoding is feasible.<n>The relevant source code will be released in open-source Julia packages LatticeDecoder.jl and SymplecticGKP.jl.
  arXiv  Detail & Related papers  (2026-09-02T18:00:19Z)
• Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
  Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
  arXiv  Detail & Related papers  (2026-02-27T19:00:00Z)
• Bases of Riemann-Roch spaces associated with arbitrary elliptic curve divisors and their application in constructing various elliptic Codes families [0.0]
  We establish the feasibility and provide exact algorithms for constructing bases of Riemann--Roch spaces corresponding to arbitrary divisors on elliptic curves.<n>We derive bases for quasi-cyclic elliptic codes and their subfield subcodes as well as for the class of Goppa-like elliptic codes.
  arXiv  Detail & Related papers  (2025-08-06T11:34:05Z)
• The Tangent Space Attack [0.0]
  We propose a new method for retrieving the structure of a generic alternant code given an arbitrary generator matrix.<n>We then discuss how this challenges the security of the McEliece cryptosystem instantiated with this family of codes.
  arXiv  Detail & Related papers  (2025-05-15T11:30:46Z)
• CodeRAG: Supportive Code Retrieval on Bigraph for Real-World Code Generation [69.684886175768]
  Large language models (LLMs) have shown promising performance in automated code generation.<n>In this paper, we propose CodeRAG, a retrieval-augmented code generation framework.<n> Experiments show that CodeRAG achieves significant improvements compared to no RAG scenarios.
  arXiv  Detail & Related papers  (2025-04-14T09:51:23Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• MinRank Gabidulin encryption scheme on matrix codes [6.471199354529622]
  We propose a generalization of the McEliece scheme and the Niederreiter frame to matrix codes and the MinRank problem. Our new approach permits to achieve better trade-off between ciphertexts and public key than the classical McEliece scheme.
  arXiv  Detail & Related papers  (2024-05-26T12:04:01Z)
• Maximally Extendable Sheaf Codes [5.439020425819001]
  We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes. We introduce a new property of a sheaf code, called maximalibility, which ensures that within class of codes on the same coded space, we encounter as few obstructions as possible.
  arXiv  Detail & Related papers  (2024-03-06T12:20:49Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes [59.55193427277134]
  Reed-Muller (RM) codes achieve the capacity of general binary-input memoryless symmetric channels. RM codes only admit limited sets of rates. Efficient decoders are available for RM codes at finite lengths.
  arXiv  Detail & Related papers  (2023-01-16T04:11:14Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• KO codes: Inventing Nonlinear Encoding and Decoding for Reliable Wireless Communication via Deep-learning [76.5589486928387]
  Landmark codes underpin reliable physical layer communication, e.g., Reed-Muller, BCH, Convolution, Turbo, LDPC and Polar codes. In this paper, we construct KO codes, a computationaly efficient family of deep-learning driven (encoder, decoder) pairs. KO codes beat state-of-the-art Reed-Muller and Polar codes, under the low-complexity successive cancellation decoding.
  arXiv  Detail & Related papers  (2021-08-29T21:08:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.