English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Internet communication systems involving cryptography and data hiding oftenrequire billions of random numbers. In addition to the speed of the algorithm,the quality of the pseudo-random number generator and the ease of itsimplementation are common practical aspects. In this work we will discuss howto improve the quality of random numbers independently from their generationalgorithm. We propose an additional implementation technique in order to takeadvantage of some chaotic properties. The statistical quality of our solutionstems from some well-defined discrete chaotic iterations that satisfy thereputed Devaney's definition of chaos, namely the chaotic iterations technique.Pursuing recent researches published in the previous International Conferenceon Evolving Internet (Internet 09, 10, and 11), three methods to buildpseudorandom generators by using chaotic iterations are recalled. Usingstandard criteria named NIST and DieHARD (some famous batteries of tests), wewill show that the proposed technique can improve the statistical properties ofa large variety of defective pseudorandom generators, and that the issuesraised by statistical tests decrease when the power of chaotic iterationsincrease.

An optimization technique on pseudorandom generators based on chaotic iterations