1. A method of generating uniform and independent random numbers, comprising the steps of: obtaining a positive integer d called modulus, obtaining a positive integer z called multiplier coprime with d, obtaining a positive integer n called initial value or seed coprime with d, generating a coset n<z>={r 1 , r 2 ,. .. } generated by 
 r 1 =n, r j+1 ≡zr j mod ( d ), 0 <r j <d, in a reduced residue class group modulo d or in groups isomorphic to it, and outputting a random number sequence {v 1 , v 2 ,. .. } by realizing the arithmetic, 
 v j =r j /d, j= 1, 2,. .. , wherein said modulus d is formed as a product d=p 1 p 2 of two distinct odd primes p 1 , p 2 , said odd primes p 1 , p 2 fulfill a condition that integers 
 q 1 =( p 1 −1)/2, q 2 =( p 2 −1)/2, are coprime, realizing the period T=2q 1 q 2 of said output sequence, said integers q 1 , q 2 consist of one even and one odd integers, and said multiplier z is determined with a primitive root z 1 of said prime p 1 and a primitive root z 2 of said prime p 2 by congruence relations 
 z≡z 1 mod ( p 1 ), z≡z 2 mod ( p 2 ), 0 <z<d=p 1 p 2 .