Selected work

Representative Papers

Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography

Apr 20, 2026

This work addresses the challenges of large ciphertext sizes and security vulnerabilities arising from algebraic structure leakage in post-quantum cryptography by investigating subspace subcodes of Lambda-Gabidulin codes. Through coordinate scaling, these subcodes are linked to classical subcodes of Gabidulin codes, enabling the first explicit linearized polynomial representation. The study fully characterizes their dimension, encoding structure, and algebraic invariants of their base-field matrix images. Leveraging these insights, a novel random subcode generation method is proposed that conceals algebraic invariants, leading to a new LGS-Niederreiter public-key encryption scheme. At security levels of 128, 192, and 256 bits, this scheme achieves the smallest ciphertext size reported to date while maintaining competitive public-key sizes.

0 citationsRead paper

Improved Decoding Algorithm of BD-LRPC Codes

Apr 18, 2025

In BD-LRPC code decoding, conventional two-stage approaches employ syndrome expansion in the first stage to improve efficiency; however, this significantly degrades the error support recovery probability in the second stage, limiting overall error-correction capability. To address this bottleneck, we propose a novel error support recovery method based on successive linear subspace intersections, replacing the standard support expansion mechanism. Our approach leverages rank-based modeling and optimized syndrome support structure design, achieving substantial gains in support reconstruction success rate without increasing computational complexity. Theoretical analysis and experimental evaluation demonstrate that the proposed scheme surpasses the theoretical performance limit of the second-stage decoding for BD-LRPC codes, enabling correction of a larger number of errors. Compared to baseline decoders, our method achieves a significant improvement in decoding success probability.

0 citationsRead paper

Recent publications

Latest Papers

Subcodes of Lambda-Gabidulin Codes for Compact-Ciphertext Cryptography

Apr 20, 2026

This work addresses the challenges of large ciphertext sizes and security vulnerabilities arising from algebraic structure leakage in post-quantum cryptography by investigating subspace subcodes of Lambda-Gabidulin codes. Through coordinate scaling, these subcodes are linked to classical subcodes of Gabidulin codes, enabling the first explicit linearized polynomial representation. The study fully characterizes their dimension, encoding structure, and algebraic invariants of their base-field matrix images. Leveraging these insights, a novel random subcode generation method is proposed that conceals algebraic invariants, leading to a new LGS-Niederreiter public-key encryption scheme. At security levels of 128, 192, and 256 bits, this scheme achieves the smallest ciphertext size reported to date while maintaining competitive public-key sizes.

0 citationsRead paper

Improved Decoding Algorithm of BD-LRPC Codes

Apr 18, 2025

In BD-LRPC code decoding, conventional two-stage approaches employ syndrome expansion in the first stage to improve efficiency; however, this significantly degrades the error support recovery probability in the second stage, limiting overall error-correction capability. To address this bottleneck, we propose a novel error support recovery method based on successive linear subspace intersections, replacing the standard support expansion mechanism. Our approach leverages rank-based modeling and optimized syndrome support structure design, achieving substantial gains in support reconstruction success rate without increasing computational complexity. Theoretical analysis and experimental evaluation demonstrate that the proposed scheme surpasses the theoretical performance limit of the second-stage decoding for BD-LRPC codes, enabling correction of a larger number of errors. Compared to baseline decoders, our method achieves a significant improvement in decoding success probability.

0 citationsRead paper