Related papers: Generating k-independent variables in constant tim…
In this paper, we focus on analyzing the period distribution of the inversive pseudorandom number generators (IPRNGs) over finite field $({\rm Z}_{N},+,\times)$, where $N>3$ is a prime. The sequences generated by the IPRNGs are transformed…
A framework is proposed for the unconditional generation of synthetic time series based on learning from a single sample in low-data regime case. The framework aims at capturing the distribution of patches in wavelet scalogram of time…
Pseudorandom number generators have been widely used in Monte Carlo methods, communication systems, cryptography and so on. For cryptographic applications, pseudorandom number generators are required to generate sequences which have good…
We consider a Hamiltonian $H=H^{0}(p)+\kappa H^{1}(p,q,t)$, $(p,q)\in {\mathbb{R}}^{n} \times {\mathbb{T}}^n$, $t\in{\mathbb{R}}$ where $\kappa \in {\mathbb{R}}$ is a small perturbation parameter and $p$, $q$ are the action and angle…
Quantum random number generators (QRNGs) produce random numbers based on the intrinsic probabilistic nature of quantum mechanics, making them true random number generators (TRNGs). In this paper, we design and fabricate an embedded QRNG…
We demonstrate on-chip quantum random number generation at high data rates using the random phases of gain-switched laser pulses. Interference of the gain-switched pulses produced by two independent semiconductor lasers is performed on a…
For a finite valued field extension $(L/K,v)$ we describe the problem of find sets of generators for the corresponding extension $\mathcal O_L/\mathcal O_K$ of valuation rings. The main tool to obtain such sets are complete sets of (key)…
In this note, we give a practical solution to the problem of determining the maximal period of matrix generators of pseudo-random numbers which are based on an integer-valued unimodular matrix of size NxN known as MIXMAX and arithmetic…
Random numbers represent an indispensable resource for many applications. A recent remarkable result is the realization that non-locality in quantum mechanics can be used to certify genuine randomness through Bell's theorem, producing…
The intrinsic random nature of quantum physics offers novel tools for the generation of random numbers, a central challenge for a plethora of fields. Bell non-local correlations obtained by measurements on entangled states allow for the…
As a fundamental phenomenon in nature, randomness has a wide range of applications in the fields of science and engineering. Among different types of random number generators (RNG), quantum random number generator (QRNG) is a kind of…
We describe a phase space generator which is flat for massless particles, and approximately flat for massive particles of masses much smaller than the typical mometum scales involved in the process. The same goal is achieved by the RAMBO…
We propose a temporally coherent generative model addressing the super-resolution problem for fluid flows. Our work represents a first approach to synthesize four-dimensional physics fields with neural networks. Based on a conditional…
The automaton constrained tree knapsack problem is a variant of the knapsack problem in which the items are associated with the vertices of the tree, and we can select a subset of items that is accepted by a top-down tree automaton. If the…
The ability to produce random numbers that are unknown to any outside party is crucial for many applications. Device-independent randomness generation does not require trusted devices and therefore provides strong guarantees of the security…
In this paper, we establish some finiteness results about the multiplicative dependence of rational values modulo sets which are `close' (with respect to the Weil height) to division groups of finitely generated multiplicative groups of a…
From dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A…
Quantum Random Number Generators provide true physical randomness based on quantum processes, essential for cryptographic and scientific applications. However, practical implementations face challenges in robustness and verifiability:…
We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs.…
Let X be randomly chosen from {-1,1}^n, and let Y be randomly chosen from the standard spherical Gaussian on R^n. For any (possibly unbounded) polytope P formed by the intersection of k halfspaces, we prove that |Pr [X belongs to P] - Pr [Y…