PRNG permanent compromise attack

Revision as of 22:23, 11 February 2007 by Wvande (Talk | contribs)

Jump to: navigation, search


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.

This is an Attack. To view all attacks, please see the Attack Category page.