This paper proposes the first constant-time decoding algorithm for Augmented Gabidulin (AG) codes, a variation of Gabidulin codes used in efficient rank-based cryptosystems.

The paper provides distinguishers for McEliece type cryptosystems with larger row and column weights, and presents a framework to turn distinguishers into key-recovery attacks. It successfully attacks…

The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…

The paper derives an explicit representation for the Euclidean dual of Hyperderivative Reed-Solomon codes and studies reverse self-dual HRS codes.

The paper systematically investigates the conditions under which linear layers in AES-like ciphers avoid related-differential structures, proving that the MDS property is necessary and identifying spe…

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…

This paper proposes using a generalized minimum-distance (GMD) soft-decision Reed-Solomon decoder for HQC post-quantum cryptography, significantly reducing required codeword length and improving hardw…

This paper introduces and studies the block tensor rank of sum-rank metric codes, showing its additive decomposition and deriving lower bounds.

The paper analyzes the security of the post-quantum signature scheme CROSS by showing that the underlying Restricted Syndrome Decoding problem can be reduced to both code-based and lattice-based probl…

This paper systematically analyzes binomial functions over $\mathbb{F}_{p^n}$ in characteristic 3, providing a classification and rigorous proof of specific classes of exponents that yield extremely l…

This paper presents a cryptanalytic attack demonstrating that a specific code-based Private Information Retrieval (PIR) scheme can be broken, allowing the server to efficiently determine the requested…

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…

This paper develops a new decoding algorithm for Desarguesian spread codes to uniquely decode in the presence of insertions and deletions, even when the sum of their dimensions exceeds half the minimu…

The paper establishes that the existence of many-time secure uncloneable encryption (UCE) can be shown to follow from relatively weak assumptions, such as the existence of many-time secure symmetric k…

The paper introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

This paper introduces minimal additive codes over Fqh and establishes a one-to-one correspondence between minimal additive codes and additive strong blocking sets. It also compares this framework with…