UC San Diego inventors have come up with a new method for improving pseudo-random number generators. Based on new theoretical achievements in algebraic theory of quasigroups, it can work over alphabets of n-bit letters for every n>1, and can enlarge the period of the pseudo random string of numbers and pass every known statistical test of randomness. The method is easy to implement in software or hardware in less than 1 kilobyte of memory space. The method can also be used as an improver of biased truly random number generators.
Country | Type | Number | Dated | Case |
United States Of America | Issued Patent | 8,041,031 | 10/18/2011 | 2005-048 |