Related papers: Pseudo-random number generation with $\beta$-encod…
Random numbers are essential for applications ranging from secure communications to numerical simulation and quantitative finance. Algorithms can rapidly produce pseudo-random outcomes, series of numbers that mimic most properties of true…
This work studies the problem of separate random number generation from correlated general sources with side information at the tester under the criterion of statistical distance. Tight one-shot lower and upper performance bounds are…
Quantum mechanics offers a fundamentally unpredictable entropy source due to the intrinsic probabilistic nature of quantum measurements, making it attractive for secure random number generation. This paper explores the practicality of…
De, Trevisan and Tulsiani [CRYPTO 2010] show that every distribution over $n$-bit strings which has constant statistical distance to uniform (e.g., the output of a pseudorandom generator mapping $n-1$ to $n$ bit strings), can be…
Lots of researches indicate that the inefficient generation of random numbers is a significant bottleneck for information communication applications. Therefore, Field Programmable Gate Array (FPGA) is developed to process a scalable…
The eight-port homodyne detector is an optical circuit designed to perform the monitoring of two quadratures of an optical field, the signal. By using quantum Bose fields and quantum stochastic calculus, we give a complete quantum…
For a given base $\gamma$ and a digit set ${\mathcal B}$ we consider optimal representations of a number $x$, as defined by Dajani at al. in 2012. For a non-integer negative base $\gamma=-\beta<-1$ and the digit set ${\mathcal…
In this paper, our main focus is expressing real numbers on the non-integer bases. We denote those bases as $\beta$'s, which is also a real number and $\beta \in (1,2)$. This project has 3 main parts. The study of expansions of real numbers…
The objective of this project is to utilize an FPGA board which is the CMOD A7 35t to obtain a pseudo random number which can be used for encryption. We aim to achieve this by leveraging the inherent randomness present in environmental data…
One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is…
We analytically derive the bit-string probability distributions of subsystems of random pure states and depolarized random states using the Dirichlet distribution. We identify the exact Beta distribution as the universal statistical law of…
Since the work of Ferrenberg et al.[PRL 69, (1992)] some pseudo random number generators are known to yield wrong results in cluster Monte Carlo simulations. In this contribution the fundamental mechanism behind this failure is discussed.…
We present a simple approach to realize truly random number generation based on measurement of the phase noise of a single mode vertical cavity surface emitting laser (VCSEL). The true randomness of the quantum phase noise originates from…
Let $P = \{p(i)\}$ be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, there are nontrivial $P$ for which known methods find a…
Pseudorandom circuits generate quantum states and unitary operators which are approximately distributed according to the unitarily invariant Haar measure. We explore how several design parameters affect the efficiency of pseudo-random…
Quantum random number generators employ the inherent randomness of quantum mechanics to generate truly unpredictable random numbers, which are essential in cryptographic applications. While a great variety of quantum random number…
We study expansions in non-integer negative base -{\beta} introduced by Ito and Sadahiro. Using countable automata associated with (-{\beta})-expansions, we characterize the case where the (-{\beta})-shift is a system of finite type. We…
Secure random numbers are a fundamental element of many applications in science, statistics, cryptography and more in general in security protocols. We present a method that enables the generation of high-speed unpredictable random numbers…
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:…
An approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness…