This site is the archived OWASP Foundation Wiki and is no longer accepting Account Requests.
To view the new OWASP Foundation website, please visit

Difference between revisions of "PRNG permanent compromise attack"

Jump to: navigation, search
m (Examples)
Line 18: Line 18:

Latest revision as of 12:51, 5 November 2007


A type of PRNG state compromise extension attack in which an attacker compromises the state of the PRNG at some arbitrary time t. From t, all future and past states of the PRNG become vulnerable to attack [1].


In 1999, Reliable Software Technologies was able to crack the card shuffling algorithm used in an online Texas Hold 'Em card game (using software developed by ASF Software Inc.). By identifying the seed value used by ASF's PRNG algorithm, Reliable was able to identify how the cards would be shuffled and, hence, the contents of the deck [2].

This article is a stub. You can help OWASP by expanding it or discussing it on its Talk page.