Non-Archimedean Ergodic Theory and Pseudorandom Generators

The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmetic and bitwise logical ones) as continuous functions on the...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:arXiv.org
Hlavný autor: Anashin, Vladimir
Médium: Paper
Jazyk:English
Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 07.10.2007
Predmet:
Continuity (mathematics)
Ergodic processes
Generators
Integers
Microprocessors
Pseudorandom
Sequences
Software
ISSN:2331-8422
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:The paper develops techniques in order to construct computer programs, pseudorandom number generators (PRNG), that produce uniformly distributed sequences. The paper exploits an approach that treats standard processor instructions (arithmetic and bitwise logical ones) as continuous functions on the space of 2-adic integers. Within this approach, a PRNG is considered as a dynamical system and is studied by means of the non-Archimedean ergodic theory.
Bibliografia:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.0710.1418