ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2603.19656v1· 20 results

quant-phcs.CRMay 11, 2026

On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem

Zvika Brakerski, Henry Yuen

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…

View →
quant-phcs.CRRecentMay 29, 2026

Software Platform for Hybrid Pseudo-Random Sequence Generation and Predictability Analysis Based on LFSR and Mersenne Twister

Ali Abdolrahimi Zarnagh, Ali Motazedifard

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…

View →
cs.DSEmpiricalRecentJun 21, 2026

Modular Rank and Linear-Complexity Tests for Pseudorandom Number Generators

Sebastiano Vigna

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…

View →
cs.LGcs.NEEmpiricalRecentSep 29, 2026

Where Does Randomness Matter in Neural Cellular Automata?

Fei Zuo, Jiaqi Shi, Yujing Liu

This paper investigates the effects of update randomness in neural cellular automata and separates training and evaluation update modes.

View →
cs.ARcs.LGEmpiricalRecentJun 15, 2026

TreeGRNG: Binary Tree Gaussian Random Number Generator for Efficient Probabilistic AI Hardware

Jonas Crols, Guilherme Paim, Shirui Zhao, Marian Verhelst

This paper proposes an ultra-low-power binary tree random number generator for Bayesian Neural Networks.

View →
cs.NEcs.DSTheoreticalRecentJun 11, 2026

The $(1 + 1)$-EA in Dynamic Environments

Georg Hasebe, Johannes Lengler, Raghu Raman Ravi

The authors study the (1+1)-EA in dynamic linear environments and prove sharp thresholds for mutation rates in two models.

View →
cs.CRMay 18, 2026

Structural Analysis of Cryptographic Sequences using Stringology-Based Fingerprinting

Victor Kebande

The paper introduces a stringology-based fingerprinting (SBF) framework to structurally analyze cryptographic sequences, demonstrating that pattern analysis can reveal measurable structural signatures…

View →
cs.DScs.CRmath.NTMay 17, 2026

Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice

Ming-Xing Luo

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…

View →
cs.DCcs.AREmpiricalRecentJun 24, 2026

Programmable Probabilistic Computer with 1,000,000 p-bits

Navid Anjum Aadit, Xiuqi Zhang, Shuvro Chowdhury, Kevin Callahan-Coray +9 more

A million-p-bit probabilistic computer is built by networking FPGAs to accelerate sampling and optimization of Ising models.

View →
cs.CRcs.AIcs.LGMay 8, 2026

Seed Hijacking of LLM Sampling and Quantum Random Number Defense

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…

View →
cs.DCcs.ITcs.NITheoreticalRecentJun 18, 2026

Fault-Tolerant Shared-Relay Communication in Circulant Interconnection Networks

Bader Albader, Galal Hassan, Mohamed R. Al-Mulla

This paper investigates the worst-case shared-relay multiplicity in directed circulants for fault-tolerant networks.

View →
cs.DMcs.ITTheoreticalRecentJun 11, 2026

Entropic Generation of Binary Words

Olivier Bodini, Francis Durand

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

View →
cs.CCTheoreticalRecentOct 7, 2026

The smallest programmable machine and the hardness of analyzing it

J. Andres Montoya

The paper investigates the computational complexity of deterministic k-pebble automata and their relation to finite automata and Kolmogorov complexity.

View →
cs.CRcond-mat.otherq-bio.OTMar 17, 2026

Synchronized DNA sources for unconditionally secure cryptography

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…

View →
cs.ARcs.MSRecentJun 3, 2026

GoldenFloat: A Phi-Derived Static-Split Floating-Point Family from GF4 to GF256 with a Lucas-Exact Integer Identity

Dmitrii Vasiliev

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

View →
cs.FLcs.CCcs.DSTheoreticalRecentJul 28, 2026

Breaking the $4^k$ Barrier for the $k$-Distinct Language

Ran Ben Basat

This paper presents a new nondeterministic finite automaton (NFA) for recognizing repetition-free words over a given alphabet, improving on the previous construction.

View →
cs.CRcs.CYEmpiricalRecentSep 25, 2026

Verifiable Randomness for Blockchain-Based Lottery Systems

Gonçalo Ferreira, André Zúquete, Paulo Bartolomeu

This paper proposes a new platform for verifiable on-chain randomness that addresses the last revealer attack.

View →
cs.CRApr 30, 2026

SBN Explorer: An Empirical Study of Cryptographic Boolean Networks

Arnaud Valence

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…

View →