~ similar to 2603.23364v2· 20 results
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 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 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…
The paper presents a highly optimized, low-stack implementation of the HAETAE signature scheme, reducing peak stack usage significantly to enable its use on severely memory-constrained microcontroller…
This paper proposes Stringology-Based Cryptology (SBC), a novel approach that analyzes the structural properties of cryptographic outputs by treating them as symbolic sequences, offering complementary…
The paper proposes a novel symmetric Fully Homomorphic Encryption (FHE) scheme that manages noise growth and computational overhead by fragmenting the plaintext and using a dual-regulator system for m…
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 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 introduces a stringology-based fingerprinting (SBF) framework to structurally analyze cryptographic sequences, demonstrating that pattern analysis can reveal measurable structural signatures…
This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.
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 demonstrates that a proposed lightweight RFID authentication protocol is structurally insecure and susceptible to a multi-session algebraic attack, enabling full compromise of the secret ke…
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.
The paper introduces a Neural Stringology Cryptanalysis (NSC) framework that uses machine learning to detect subtle structural patterns in stream cipher keystreams, demonstrating its potential for eva…
The paper introduces ECCFROG522PP, a 522-bit prime-field elliptic curve designed for high security, emphasizing deterministic generation and public reproducibility over performance.
This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in lattices by incorporating domain-informed representation, thereby extending its applicability to modul…
This paper enhances a genetic algorithm approach for solving the Shortest Vector Problem (SVP) in both integral and module lattices by incorporating domain-informed representation and crossover.
The paper constructs high-rate public-key pseudorandom codes (PRCs) robust against edit errors, providing the first such binary constructions under assumptions that yield Hamming-robust PRCs.
This paper provides an explicit cost analysis of Toom-4 multiplication specifically tailored for the incomplete Number Theoretic Transform (NTT) framework, offering a concrete cost model for hybrid la…
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…