Related papers: An optimization technique on pseudorandom generato…

This paper explores the deep-zoom properties of the chaotic k-logistic map, in order to propose an improved chaos-based cryptosystem. This map was shown to enhance the random features of the Logistic map, while at the same time reducing the…

The optimizations of the track fittings require complex simulations of silicon strip detectors to be compliant with the fundamental properties of the hit heteroscedasticity. Many different generations of random numbers must be available…

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…

We attempt to better understand randomization in local distributed graph algorithms by exploring how randomness is used and what we can gain from it: - We first ask the question of how much randomness is needed to obtain efficient…

Polynomial chaos based methods enable the efficient computation of output variability in the presence of input uncertainty in complex models. Consequently, they have been used extensively for propagating uncertainty through a wide variety…

Chaotic iterations have been introduced on the one hand by Chazan, Miranker [5] and Miellou [9] in a numerical analysis context, and on the other hand by Robert [11] and Pellegrin [10] in the discrete dynamical systems framework. In both…

Chaos, a nonlinear dynamical system, favors cryptography due to their inherent sensitive dependence on the initial condition, mixing, and ergodicity property. In recent years, the nonlinear behavior of chaotic maps has been utilized as a…

Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…

Random number generation is crucial in many aspects of everyday life, as online security and privacy depend ultimately on the quality of random numbers. Many current implementations are based on pseudo-random number generators, but…

We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact…

Stochastic network optimization problems entail finding resource allocation policies that are optimum on an average but must be designed in an online fashion. Such problems are ubiquitous in communication networks, where resources such as…

This article studies the fundamental problem of using i.i.d. coin tosses from an entropy source to efficiently generate random variables $X_i \sim P_i$ $(i \ge 1)$, where $(P_1, P_2, \dots)$ is a random sequence of rational discrete…

This paper targets to search so-called \emph{good} generators by doing a brief survey over the generators developed in the history of pseudo-random number generators (PRNGs), verify their claims and rank them based on strong empirical tests…

In various fields of natural science, the chaotic systems of differential equations are considered more than 50 years. The correct prediction of the behaviour of solutions of dynamical model equations is important in understanding of…

The fundamental principles of quantum mechanics, such as its probabilistic nature, allow for the theoretical ability of quantum computers to generate statistically random numbers, as opposed to classical computers which are only able to…

The problem of constructing effective statistical tests for random number generators (RNG) is considered. Currently, statistical tests for RNGs are a mandatory part of cryptographic information protection systems, but their effectiveness is…

Capacity is an important tool in decision-making under risk and uncertainty and multi-criteria decision-making. When learning a capacity-based model, it is important to be able to generate uniformly a capacity. Due to the monotonicity…

In this paper, we numerically demonstrate a new extraction scheme for generating ultra-fast physically random sequence of bits. For this purpose, we utilize a dual-channel optical chaos source with suppressed time delayed (TD) signature in…

We demonstrate the physical generation of random bits at high bit rates (> 100 Gb/s) using optical chaos from a solitary laser diode and therefore without the complex addition of either external optical feedback or injection. This striking…

A key trait of stochastic optimizers is that multiple runs of the same optimizer in attempting to solve the same problem can produce different results. As a result, their performance is evaluated over several repeats, or runs, on the…