Fast K System Generators of Pseudorandom Numbers
Abstract
We suggest fast algorithm for the matrix generator of pseudorandom numbers based on KolmogorovAnosov K systems which has been earliar proposed in \cite{savvidy1,akopov1}. 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.
 Publication:

arXiv eprints
 Pub Date:
 November 1993
 arXiv:
 arXiv:heplat/9311025
 Bibcode:
 1993hep.lat..11025A
 Keywords:

 High Energy Physics  Lattice
 EPrint:
 6 pages, Latex, CreteTH7July1993