Fast K System Generators of Pseudorandom Numbers
Abstract
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 N2 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.