Skip to Main Content

SQL & PL/SQL

Announcement

For appeals, questions and feedback about Oracle Forums, please email oracle-forums-moderators_us@oracle.com. Technical questions should be asked in the appropriate category. Thank you!

Rainbow tables

648553Sep 11 2008 — edited Sep 11 2008
Hi,

I posted this a while back, but

a) When I search for my own threads, it never turns up. And the keyword "rainbow" returns one thread and it's not mine.
b) No answer really applied

Anyway, I'm looking to build myself a rainbow table. This is basically a method of reversing the MD5 hash. I will be writing an application to cycle through a, aa, ab, etc and insert the value and its hash into a table. Those values can then be looked up.

I'm looking for the optimum way to do it.

I'm assuming a moving away from the current Perl implementation would be a start.

So some ideas at the moment are:

Don't add an index to the table until after it's built
Don't commit after every insert, perhaps every 1000 inserts will do?

This is still going to be a terribly long insert. Any ideas on what I should be reading to optimise this process?

To avoid any unrelated answers, please note this table will be built on the fly based on the hash algorithm, this is not a case of a text or XML file to import.
Comments
Locked Post
New comments cannot be posted to this locked post.
Post Details
Locked on Oct 9 2008
Added on Sep 11 2008
12 comments
661 views