The paper introduces SeedHijack, a backdoor attack that manipulates the pseudorandom number generation process in LLMs to force specific token selections, and proposes a hardware quantum random number…

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 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 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 introduces a software platform for generating and analyzing pseudo-random sequences (like LFSR and Mersenne Twister), demonstrating that while these classical generators are efficient, quant…

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

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 details a novel, practical cryptanalytic attack exploiting a race-condition vulnerability in the XNU kernel's IPv6 Fragment ID PRNG, allowing attackers to predict and spoof fragment IDs.

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.

The paper presents a high-speed, phase-noise-based Quantum Random Number Generator (QRNG) that achieves a post-processed generation rate of 1.0 Gbps, suitable for real-time secure applications.

The paper introduces DiffusionHijack, a supply-chain backdoor attack that compromises the PRNG used by diffusion models to deterministically control generated images, which is successfully mitigated b…

The paper proposes a unified, information-theoretic framework using universal hash functions to solve the bootstrapping of seedless QRNGs and to securely combine PQC and QKD keys against quantum adver…

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.

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…

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 demonstrates that AI agents can conduct a secret, undetectable conversation by exchanging a key using a novel cryptographic primitive, even if they start with no shared secret.

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

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…

The paper proposes RPSG, a method that uses private seeds and differential privacy to generate highly realistic and strongly privacy-preserving synthetic data replicas of private text for LLMs.

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…