Pseudorandom Number Generators with Balanced Gray Codes
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | Pseudorandom Number Generators with Balanced Gray Codes |
| Type de publication | Conference Paper |
| Year of Publication | 2014 |
| Auteurs | Couchot J.-F, Heam P.-C, Guyeux C., Wang Q., Bahi J.M |
| Editor | Obaidat MS, Holzinger A, Samarati P |
| Conference Name | 2014 11TH INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY (SECRYPT) |
| Publisher | Inst Syst & Technologies Informat, Control & Commun; ACM Specail Interest Grp Design Commun; ACM Special Interest Grp Secur Audit & Control; Int Assoc Cryptol Res; Austrian Comp Soc; Vienna Univ Technol; SBA Res |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-989-8565-95-2 |
| Mots-clés | Gray Codes, Hamiltonian Paths, Markov Matrices, Mixing Time, Pseudorandom Number Generator, statistical tests, Theory of Chaos |
| Résumé | In this article, it is shown that a large class of truly chaotic Pseudorandom Number Generators can be constructed. The generators are based on iterating Boolean maps, which are computed using balanced Gray codes. The number of such Gray codes gives the size of the class. The construction of such generators is automatic for small number of bits, but remains an open problem when this number becomes large. A running example is used throughout the paper. Finally, first statistical experiments of these generators are presented, they show how efficient and promising the proposed approach seems. |