Editing Random number (section)

==Algorithms and implementations==
Random numbers are frequently used in [[algorithm]]s such as [[Donald Knuth|Knuth's]] 1964-developed [[algorithm]]<ref>{{cite journal |author=Richard Durstenfeld
|title=Algorithm 235: Random permutation |doi=10.1145/364520.364540
|journal=[[Communications of the ACM]]
|volume=7 |issue=7 |page=420 |date=July 1964}}</ref> for shuffling lists. (popularly known as ''the [[Donald Knuth|Knuth]] shuffle'' or ''the [[Fisher–Yates shuffle]]'', based on work they did in 1938).

In 1999, a new feature was added to the [[Pentium III]]: a hardware-based [[random number generator]].<ref name=Random.NetwCom99>
   {{cite magazine  |magazine=[[Network Computing]]
   |title=Privacy's Random Nature
   |author=Robert Moscowitz  |date=July 12, 1999}}</ref><ref name=RandomPenIII.Wired99>{{cite magazine  |magazine=[[Wired (magazine)|Wired]]
|url=https://www.wired.com/1999/01/hardwiring-security
|title=Hardwiring Security  |date=January 1999}}</ref> It has been described as "several [[oscillators]] combine their outputs and that odd waveform is sampled asynchronously."<ref>{{cite web
   |url=http://www.ciphersbyritter.com/NEWS4/PENTRAND.HTM
   |author=Terry Ritter  |date=January 21, 1999
   |title=The Pentium III RNG}}</ref> These numbers, however, were only 32 bit, at a time when export controls were on 56 bits and higher, so they were not state of the art.<ref>{{cite web 
|url=https://www.irisa.fr/caps/projects/hipsor/misc.php
|title=Unpredictable Randomness Definition |website=IRISA}}</ref>