Related papers: A Chaotic Cipher Mmohocc and Its Randomness Evalua…
In this paper, by using Logistic, Sine and Tent systems we define a combination chaotic system. Some properties of the chaotic system are studied by using figures and numerical results. A color image encryption algorithm is introduced based…
Consistent hashing (CH) has been pivotal as a data router and load balancer in diverse fields, including distributed databases, cloud infrastructure, and peer-to-peer networks. However, existing CH algorithms often fall short in…
This work presents the hardware demonstrator of a secure encryption system based on synchronised Chua chaotic circuits. In particular, the presented encryption system comprises two Chua circuits that are synchronised using a dedicated…
We establish a rigorous connection between quantum coherence and quantum chaos by employing coherence measures originating from the resource theory framework as a diagnostic tool for quantum chaos. We quantify this connection at two…
Cryptographic research takes software timing side channels seriously. Approaches to mitigate them include constant-time coding and techniques to enforce such practices. However, recent attacks like Meltdown [42], Spectre [37], and…
The problem of Turing pattern formation has attracted much attention in nonlinear science as well as physics, chemistry and biology. So far all Turing patterns have been observed in stationary and oscillatory media only. In this letter we…
We proposed the deep zoom analysis of the composition of the logistic map and the tent map, which are well-known discrete unimodal chaotic maps. The deep zoom technique transforms each point of a given chaotic orbit by removing its first…
This paper presents a new procedure of generating hash functions which can be evaluated using some mathematical tools. This procedure is based on discrete chaotic iterations. First, it is mathematically proven, that these discrete chaotic…
Generating random bits from a source of biased coins (the biased is unknown) is a classical question that was originally studied by von Neumann. There are a number of known algorithms that have asymptotically optimal information efficiency,…
Chaotic iterations, a tool formerly used in distributed computing, has recently revealed various interesting properties of disorder leading to its use in the computer science security field. In this paper, a comprehensive study of its…
Random numbers are indispensable resources for application in modern science and technology. Therefore, a dedicate entropy source is essential, particularly cryptographic tasks and modern applications. In this work, we experimentally…
In this article we study a relatively novel way of constructing chaotic sequences of probability measures supported on Kac's sphere, which are obtained as the law of a vector of $N$ i.i.d. variables after it is rescaled to have unit average…
The study of experimental data is a relevant task in several physical, chemical and biological applications. In particular, the analysis of chaotic dynamics in cardiac systems is crucial as it can be related to some pathological…
A stream cipher was implemented on a FPGA. The keystream, for some authors the most important element, was developed using an algorithm based on Bernoullis chaotic map. When dynamic systems are digitally implemented, a normal degradation…
We shall review the cellular automaton(CA)-based pseudorandom-number generators (PRNGs), and show that one of these PRNGs can generate high-quality random numbers which can pass all of the statistical tests provided by the National…
Markov chain Monte Carlo (MCMC) is a widely used sampling method in modern artificial intelligence and probabilistic computing systems. It involves repetitive random number generations and thus often dominates the latency of probabilistic…
We investigate functions that are exact solutions to chaotic dynamical systems. A generalization of these functions can produce truly random numbers. For the first time, we present solutions to random maps. This allows us to check,…
We study the problem of sequentially testing whether a given stochastic process is generated by a known Markov chain. Formally, given access to a stream of random variables, we want to quickly determine whether this sequence is a trajectory…
Physical systems exhibiting fast spontaneous chaotic oscillations are used to generate high-quality true random sequences in random number generators. The concept of using fast practical entropy sources to produce true random sequences is…
Pseudo-random number generators (PRNGs) are widely used in modern computing and are expected to exhibit excellent statistical performance and repeatability. This study evaluates and compares modern PRNGs used in high performance computing…