by eljonto on Mon Jun 01, 2009 1:38 am
([msg=24702]see Re: A hint on getting the hash.[/msg])
Rainbow tables are unneccessary for this mission, a simple tool like cain and abel or mdcrack will suffice, and all rainbow tables are is a compromise between bruteforcing and dictionary attack. Rainbow tables contain 'chains' for your program to use to find the original plaintext and each 'chain' in a rainbow table can store millions of 'virtual' plaintexts for your program to check against, even though it takes up no space- an awesome concept made possbile by reduction functions, bit tricky to get your head around, but when you do you'll realise how cool they are
-Quis custodiet ipsos custodes?, Juvenal
_________________________________________________________________