~ similar to 2603.19656v1· 20 results
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…
The paper introduces a modular version of rank and linear-complexity tests for pseudorandom number generators and provides a Rust program, modlin, to detect statistical bias in generators that are lin…
This paper investigates the effects of update randomness in neural cellular automata and separates training and evaluation update modes.
This paper proposes an ultra-low-power binary tree random number generator for Bayesian Neural Networks.
The authors study the (1+1)-EA in dynamic linear environments and prove sharp thresholds for mutation rates in two models.
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 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…
A million-p-bit probabilistic computer is built by networking FPGAs to accelerate sampling and optimization of Ising models.
Ziyang You, Xiaoke Yang, Zhanling Fan, Feng Guo +2 more
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…
This paper investigates the worst-case shared-relay multiplicity in directed circulants for fault-tolerant networks.
This paper introduces a novel algorithm for generating k Hamming weight binary words in linear time while minimizing random bit consumption.
The paper investigates the computational complexity of deterministic k-pebble automata and their relation to finite automata and Kolmogorov complexity.
Sandra Jaudou, Hélène Gasnier, Elias Boudjella, Marc Canève +10 more
The paper introduces a DNA-based cryptographic primitive that uses shared, sequenced DNA molecules to generate a common binary mask for One-Time Pad (OTP) encryption, achieving unconditional security…
This paper presents a hardware-oriented description of GoldenFloat, a static-split floating-point family, and its concrete artefacts.
This paper presents a new nondeterministic finite automaton (NFA) for recognizing repetition-free words over a given alphabet, improving on the previous construction.
This paper proposes a new platform for verifiable on-chain randomness that addresses the last revealer attack.
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…