The paper models cryptographic hybridization as a Stackelberg game where the defender optimizes algorithm selection against a resource-constrained attacker who performs conditional optimization.

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…

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.

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…

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…

The paper settles the computational complexity of Quoridor and related games by reducing them to Reisch's planar graph-Hex.

This paper establishes a complexity hierarchy for shuffle operations used in card-based cryptography, classifying them by implementation difficulty and proving separations between these levels.

This paper surveys the security vulnerabilities of Variational Quantum Circuits (VQCs) to backdoor attacks, detailing various attack mechanisms and analyzing current detection and defense strategies.

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

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…

The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…

The paper constructs strong cryptographic primitives, including key agreement and oblivious transfer, directly from classical tests of anti-commutation (ToNC) on quantum devices, while also developing…

The paper presents Broken Quantum, a comprehensive formal security audit that identifies 547 security vulnerabilities across 45 open-source quantum computing simulators, revealing critical flaws in me…

The paper argues that current lattice-based post-quantum cryptography, which relies on injecting noise, is not unconditionally secure because advanced quantum error correction and learning techniques…

The paper estimates the quantum resources required to break 256-bit ECC cryptography and warns that fast-clock quantum computers could enable on-spend attacks on modern cryptocurrencies, necessitating…

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…