Aperiodic pseudorandom number generators based on infinite words

Ľubomíra Balková, Michelangelo Bucci, Alessandro De Luca, Jiří Hladký, Svetlana Puzynina

Research output

3 Citations (Scopus)

Abstract

In this paper we study how certain families of aperiodic infinite words can be used to produce aperiodic pseudorandom number generators (PRNGs) with good statistical behavior. We introduce the well distributed occurrences (WELLDOC) combinatorial property for infinite words, which guarantees absence of the lattice structure defect in related pseudorandom number generators. An infinite word u on a d-ary alphabet has the WELLDOC property if, for each factor w of u, positive integer m, and vector v∈Zm d, there is an occurrence of w such that the Parikh vector of the prefix of u preceding such occurrence is congruent to v modulo m. (The Parikh vector of a finite word v over an alphabet A has its i-th component equal to the number of occurrences of the i-th letter of A in v.) We prove that Sturmian words, and more generally Arnoux–Rauzy words and some morphic images of them, have the WELLDOC property. Using the TestU01 [11] and PractRand [5] statistical tests, we moreover show that not only the lattice structure is absent, but also other important properties of PRNGs are improved when linear congruential generators are combined using infinite words having the WELLDOC property.

Original languageEnglish
Pages (from-to)85-100
Number of pages16
JournalTheoretical Computer Science
Volume647
DOIs
Publication statusPublished - 27 Sep 2016

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Aperiodic pseudorandom number generators based on infinite words'. Together they form a unique fingerprint.

Cite this