Related papers: Testing D-Sequences for their Randomness
Modern neural network libraries all take as a hyperparameter a random seed, typically used to determine the initial state of the model parameters. This opinion piece argues that there are some safe uses for random seeds: as part of the…
Random Wavelet Series form a class of random processes with multifractal properties. We give three applications of this construction. First, we synthesize a random function having any given spectrum of singularities satisfying some…
System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model-based testing an approach combining random testing and…
Design and cryptanalysis of chaotic encryption schemes are major concerns to provide secured information systems. Pursuing our previous research works, some well-defined discrete chaotic iterations that satisfy the reputed Devaney's…
Researchers have demonstrated that humans are unable to generate a sequence of random numbers that corresponds in a statistical sense to a simple distribution such as the uniform distribution. The purpose of this article is to present the…
This paper presents an expression to compute the exact period of a recursive random number generator based on d-sequences. Using the multi-recursive version of this generator we can produce large number of pseudorandom sequences.
One family each of repetitive and non-repetitive spreading sequences for secure Direct Sequence Spread Spectrum communication are obtained from the logistic map. The repetitive sequences are perfectly balanced and are found to have…
In this paper we study some basic properties of rough $I$-convergent double sequences in the line of D$\ddot{u}$ndar [8]. We also study the set of all rough $I$-limits of a double sequence and relation between boundedness and rough…
Randomness (in the sense of being generated in an IID fashion) and exchangeability are standard assumptions in nonparametric statistics and machine learning, and relations between them have been a popular topic of research. This short paper…
We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…
We show that in device independent quantum key distribution protocols the privacy of randomness is of crucial importance. For sublinear test sample sizes even the slightest guessing probability by an eavesdropper will completely compromise…
Randomness is a critical resource of modern cryptosystems. Quantum mechanics offers the best properties of an entropy source in terms of unpredictability. However, these sources are often fragile and can fail silently. Therefore,…
In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…
For data ciphering a key is usually needed as a base, so it is indispensable to have one that is strong and trustworthy, so as to keep others from accessing the ciphered data. This requires a pseudo-random number generator that would…
A scheme for pseudo-random binary sequence generation based on the two-dimensional discrete-time Henon map is proposed. Properties of the proposed sequences pertaining to linear complexity, linear complexity profile, correlation and…
We describe a general approach of determining the distribution of spanning subgraphs in the random graph $\G(n,p)$. In particular, we determine the distribution of spanning subgraphs of certain given degree sequences, which is a…
We consider a quantum system that is being continuously monitored, giving rise to a measurement signal. From such a stream of data, information needs to be inferred about the underlying system's dynamics. Here we focus on hypothesis testing…
We present results of an extensive test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. The generators include public domain programs,…
This paper has a practical aim. For a long time, implementations of pseudorandom number generators in standard libraries of programming languages had poor quality. The situation started to improve only recently. Up to now, a large number of…
It has been known for years how random height variations of a repeated nano-scale structure can give rise to smooth angular color variations instead of the well-known diffraction pattern experienced if no randomization is present. However,…