The paper analyzes the security of a partially masked hardware accelerator for Number Theoretic Transform (NTT) in PQC, demonstrating that the claimed security margins are significantly overestimated…

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.

The paper introduces a four-stage structural dependency analysis hierarchy that enables scalable, sound first-order masking verification for large, production-level post-quantum cryptographic accelera…

The paper provides machine-checked proofs demonstrating that fresh per-stage arithmetic masking ensures pipeline-level security for Number Theoretic Transform (NTT) accelerators used in Post-Quantum C…

The paper introduces MORPH, a framework that reformulates Zero-Knowledge Proof (ZKP) computations to efficiently utilize AI ASICs like TPUs, achieving up to 10x higher throughput on NTT.

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…

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 proves that the per-observation leakage bound for deep, multi-stage masked Number Theoretic Transform (NTT) pipelines remains constant and low ($2/q$), regardless of the pipeline's depth ($…

This paper fixes two subtle bugs in Go's extended GCD implementation, which is critical for RSA key generation, and formally proves the correctness and termination of the corrected code.

The paper establishes a universal, machine-checked 1-Bit Barrier for the internal wire map of masked Barrett reduction, providing a strong side-channel leakage bound for post-quantum cryptography.

This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.

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 introduces a novel hardware aging attack that exploits the commutative properties of addition to induce unbalanced stress on AI accelerator transistors, significantly degrading model accurac…

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…

The paper proposes a provably secure, single-round two-party computation protocol for approximate matrix multiplication using lattice-based cryptography, demonstrated for secure control law implementa…

The paper establishes the first machine-checked composition theorems for arithmetic masking over prime fields, demonstrating that fresh random masking between pipeline stages completely erases securit…

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 proposes a hash-based commit-reveal alternative to minimize the infrastructural overhead associated with adopting large post-quantum signature schemes in blockchain transactions.

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 introduces a mathematical and cryptographic framework for exactly recovering a single, noisy, high-dimensional discrete path from aggregated and incomplete observable data.