相关论文: A d-Sequence based Recursive Random Number Generat…

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…

Quantum random number generator harnesses the power of quantum mechanics to generate true random numbers, making it valuable for various scientific applications. However, real-world devices often suffer from imperfections that can undermine…

We propose a new method to generate a sequence of random numbers with long-range power-law correlations that overcomes known difficulties associated with large systems. The new method presents an improvement on the commonly-used methods. We…

A general method to produce uniformly distributed pseudorandom numbers with extended precision by combining two pseudorandom numbers with lower precision is proposed. In particular, this method can be used for pseudorandom number generation…

D-finite functions and P-recursive sequences are defined in terms of linear differential and recurrence equations with polynomial coefficients. In this paper, we introduce a class of numbers closely related to D-finite functions and…

A universal generator for integer-valued square-integrable random variables is introduced. The generator relies on a rejection technique based on a generalization of the inversion formula for integer-valued random variables. The proposal…

Pseudo-Random Numbers Generators (PRNGs) are algorithms produced to generate long sequences of statistically uncorrelated numbers, i.e. Pseudo-Random Numbers (PRNs). These numbers are widely employed in mid-level cryptography and in…

Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy.…

Many Random Number Generators (RNG) are available nowadays; they are divided in two categories, hardware RNG, that provide "true" random numbers, and algorithmic RNG, that generate pseudo random numbers (PRNG). Both types usually generate…

We have introduced in former work the concept of Deep Randomness and its interest to design Unconditionally Secure communication protocols. We have in particular given an example of such protocol and introduced how to design a Deep Random…

A modification of Koetter-Kschischang codes for random networks is presented (these codes were also studied by Wang et al. in the context of authentication problems). The new codes have higher information rate, while maintaining the same…

Random numbers are important in many activities, including communication, encryption, science, gambling, finance, and decision-making. There is a strong demand for a hardware random number generator that could support cryptographic…

Random numbers play a crucial role in science and industry. Many numerical methods require the use of random numbers, in particular the Monte Carlo method. Therefore it is of paramount importance to have efficient random number generators.…

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…

High quality random numbers are necessary in the modern world. Ranging from encryption keys in cyber security to models and simulations for scientific use: it's important that these random numbers are of high quality and quickly attainable.…

We propose a new approach to nondeterministic random number generation. In theory, the randomness originated from the uncorrelated nature of consecutive laser pulses with Poissonian photon number distribution and that of the consecutive…

In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated…

We define a growing model of random graphs. Given a sequence of nonnegative integers $\{d_n\}_{n=0}^\infty$ with the property that $d_i\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\ldots$ by the…

A physical random number generator based on the intrinsic randomness of quantum mechanics is described. The random events are realized by the choice of single photons between the two outputs of a beamsplitter. We present a simple device,…

Random sampling is a technique for signal acquisition which is gaining popularity in practical signal processing systems. Nowadays, event-driven analog-to-digital converters make random sampling feasible in practical applications. A process…