~ similar to 2603.28313v1· 20 results
The paper proposes a lightweight Zero-Knowledge authentication protocol using QR codes, enhancing the Schnorr protocol with nonces and timestamps for secure, efficient, and replay-attack-resistant aut…
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 stringology-based fingerprinting (SBF) framework to structurally analyze cryptographic sequences, demonstrating that pattern analysis can reveal measurable structural signatures…
The paper applies Stringology-Based Cryptanalysis (SBC) using KMP and Boyer-Moore algorithms to analyze EChaCha20, confirming that the cipher maintains strong pseudorandomness and exhibits rapid diffu…
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.
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 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 addresses the security vulnerability of OFDM-based Physical Layer Authentication (PLA) when channel fading exhibits correlation, proposing a new attack model and a measurable guideline to d…
This paper provides the first comprehensive cryptanalysis of the Legendre Pseudorandom Function over extension fields, demonstrating key recovery attacks under both passive and active threat models.
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 provably secure, single-round two-party computation protocol for approximate matrix multiplication using lattice-based cryptography, demonstrated for secure control law implementa…
Penghui Liu, Yi Niu, Xiaoxiong Zhong, Jiahui Wu +3 more
The paper proposes a novel identity-based public key management framework, IPK-pq, utilizing NIST ML-DSA and random matrix theory to enhance the scalability and efficiency of Public Key Infrastructure…
The paper proposes a novel, energy-efficient, and protocol-agnostic security layer for SWIPT IoT networks using a backscatter-based identification mechanism to authenticate devices without conventiona…
The paper analyzes the differential properties of the SIMON32 cipher, identifying high-probability differentials to improve the efficiency and depth of cryptanalysis beyond current state-of-the-art me…
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…
The paper proposes a Secure Parallel Determinant Computation (SPDC) framework that enables efficient, privacy-preserving, and scalable matrix determinant calculation across multiple untrusted edge ser…
The paper introduces $I$-$(OT)^2$, a novel base 1-out-of-2 Oblivious Transfer (OT) protocol designed to minimize computation and interaction for resource-constrained IoT devices.
The paper compares various strong secrecy capacities for Arbitrarily Varying and General Arbitrarily Varying Wiretap Channels, establishing equivalences under specific conditions and bounding the capa…
The paper introduces Aquaman, a transparent-proxy architecture that enables quantum-resilient session-key establishment at the network edge, protecting clients that cannot natively support post-quantu…
The paper proposes and evaluates efficient, quantum-safe variants of the Internet Key Exchange (IKE) protocol tailored for the unique resource constraints and latency challenges of satellite communica…