Extended Gabidulin-Kronecker Product Codes and Their Application to Cryptosystems

2026-01-19

AI Summary

This work addresses the trade-off among security, efficiency, and decryption failure in rank-metric code-based cryptosystems by introducing a new family of maximum rank distance (MRD) codes—Extended Gabidulin–Kronecker (EGK) codes—featuring a Kronecker product structure. A zero-failure-probability decoding algorithm is devised that operates without explicitly recovering the error vector. Leveraging these codes, three optimized variants of the Rank Quasi-Cyclic (RQC) public-key encryption scheme are constructed. At the 128-bit security level, these variants achieve significantly smaller public key sizes than the Multi-UR-AG scheme while maintaining high encryption and decryption efficiency and guaranteeing zero decryption failure rate, thereby effectively balancing security and practicality.

Technology Category

• Machine Learning: Quantum Machine Learning
• Search and Optimization: Distributed Search
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Security and Privacy: Applications of cryptography
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking
• Graph Algorithms and Modeling for the Web: Efficient manipulation of static and dynamic Web-related graphs

Abstract

In this paper, we initiate the study of Extended Gabidulin codes with a Kronecker product structure and propose three enhanced variants of the Rank Quasi-Cyclic (RQC) (Melchor et.al., IEEE IT, 2018) cryptosystem. First, we establish precise bounds on the minimum rank distance of Gabidulin-Kronecker product codes under two distinct parameter regimes. Specifically, when $n_{1}=k_{1}$ and $n_{2}=m<n_{1}n_{2}$, the minimum rank distance is exactly $n_{2}-k_{2}+1$. This yields a new family of Maximum Rank Distance (MRD) codes, which are distinct from classical Gabidulin codes. For the case of $k_{1}\leq n_{1},k_{2}\leq n_{2},n_{1}n_{2}\leq m$, the minimum rank distance $d$ of Gabidulin-Kronecker product codes satisfies a tight upper and lower bound, i.e., $n_{2}-k_{2}+1 \leq d \leq (n_{1}-k_{1}+1)(n_{2}-k_{2}+1)$. Second, we introduce a new class of decodable rank-metric codes, namely Extended Gabidulin-Kronecker product (EGK) codes, which generalize the structure of Gabidulin-Kronecker product (GK) codes. We also propose a decoding algorithm that directly retrieves the codeword without recovering the error vector, thus improving efficiency. This algorithm achieves zero decoding failure probability when the error weight is within its correction capability. Third, we propose three enhanced variants of the RQC cryptosystem based on EGK codes, each offering a distinct trade-off between security and efficiency. For 128-bit security, all variants achieve significant reductions in public key size compared to the Multi-UR-AG (Bidoux et.al., IEEE IT, 2024) while ensuring zero decryption failure probability--a key security advantage over many existing rank-based schemes.

Problem

• rank-metric codes
• post-quantum cryptography
• decryption failure
• public key size
• RQC cryptosystem

Innovation

• Extended Gabidulin-Kronecker product codes
• Maximum Rank Distance (MRD) codes
• zero decoding failure probability
• rank-metric cryptography
• RQC cryptosystem