• Making Perfect Rainbow Tables Faster

    March 28, 2010

    A Quick Background on Perfect Rainbow Tables Rainbow tables allow us to find plaintexts to cryptographic hash algorithms quickly. They are based off of Hellman Martin’s “A Cryptanalytic Time – Memory Trade-Off“. By including the step in the reduction function, Phillipe Oechslin was able to improve on Hellman Martin’s method, and we came up with [...]

 
Powered by Wordpress and MySQL. Theme by Shlomi Noach, openark.org