Fast K System Generators of Pseudorandom Numbers
We suggest fast algorithm for the matrix generator of pseudorandom numbers based on Kolmogorov-Anosov K systems which has been proposed earlier. This algorithm reduces $N^{2}$ operation of the matrix generator to $NlnN$ and essentially reduces the generation time. It also clarifies the algebraic str...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We suggest fast algorithm for the matrix generator of pseudorandom numbers
based on Kolmogorov-Anosov K systems which has been proposed earlier. This
algorithm reduces $N^{2}$ operation of the matrix generator to $NlnN$ and
essentially reduces the generation time. It also clarifies the algebraic
structure of this type of K system generators. |
---|---|
DOI: | 10.48550/arxiv.hep-lat/9311025 |