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 identifies new, algebraically weak classes of instances for the Linear Equivalence Problem (LEP) by generalizing techniques from the Permutation Equivalence Problem (PEP) using power codes…

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 traces the historical development of the square-and-multiply algorithm, arguing that while its conceptual foundation dates back to ancient Indian prosody, its formal articulation as a gener…

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…

This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

The paper establishes new hardness amplification results for Learning Parity with Noise (LPN) and its sparse variants, showing that solving the problem on a small fraction of instances implies solving…

The paper proposes using deep learning to empirically test the indistinguishability of various post-quantum and hybrid cryptographic schemes, finding that no tested combination showed a significant ad…

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

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 analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

The paper develops a formal theory to analyze how throughput changes in AI-enhanced cybersecurity pipelines when stage capacities are perturbed by multipliers.

The paper provides a unified algebraic framework to determine the formal language expressivity of recurrent neural language models, resolving conflicts in existing literature by linking expressivity t…

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…

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.

This paper develops a new threshold secret sharing scheme for cellular automata (CA) that enables anonymous reconstruction of the secret CA rules, improving upon previous characterizations using Mutua…

The paper establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

The paper proposes a novel set of combined cellular automaton (CA)-based pseudo-random number generators (PRNGs) that overcome the weak equidistribution issues of existing CA-based PRNGs, achieving ma…

The paper proposes that decoding random quantum stabilizer codes is a robust, novel post-quantum cryptographic assumption, demonstrating that its average-case hardness implies core primitives like PKE…