CSE Department Independent Study


Friday, June 12, 2009 11:30-12 JBH359

Title Feasibility of Generating Rainbow Tables

Presenter: Phil Lucas


We set out to investigate the feasibility of generating complete Rainbow Tables. Such tables can be used for cracking passwords or phishing attacks. This involved generating all printable n-byte passwords and their corresponding MD5 hash. Since there are 94 printable bytes, there are 830,584 3-byte passwords, and about 78 million 4-byte passwords, etc. This is clearly an exponential growth. We examined different parallel methods to combat this problem using multi-core systems.