This site will probably be the home of the first free "instant" MD5 database to hit a Trillion passwords "Omni-5."
I'm implementing the database as a lossy hash table (LHT).
Basically the name says it all it is a hash (lookup) table that is lossy.
The lossy part is that fact that some data is missing (not storing the full hash or the full password) but the missing data is brute forced so there are no passwords lost.
So depending on how you look at it, it's either lossy (data) or lossless (passwords).
The plan (this all depends on a few things like funding):
- Omni-5 lossy hash table target size is 3 TB for NTLM, MD5, and maybe double MD5 (which will replace the MD5 LHT).
- Omni-6 100% accurate rainbow table and lossy hash table target size is 75 GB for 5 rainbow tables at 13.0x work factor and undecided size for LHT. 100% accurate for NTLM and MD5. 99.9% for other hash functions.
- Omni-7 99.9% accurate rainbow table target size is 2 TB for NTLM and MD5.
- Maybe a "secondHalfLMChall" rainbow table I think I was looking for 256 times all-space 1-5 and alpha-numeric 6-7. Key space of 2 ^ 44.257 (21.0 Trillion [21,024,762,429,696]).
Key Spaces:
Omni-5: 2 ^ 40.028 (1.12 Trillion [1,121,284,146,783])
Omni-6: 2 ^ 45.506 (50.0 Trillion [49,973,328,108,832])
Omni-7: 2 ^ 51.259 (2.69 Quadrillion [2,694,058,161,297,215])
* - 95 characters: space through ~
M - 62 characters: A-Z, a-z, and 0-9
m - 52 characters: A-Z and a-z
n - 36 characters: a-z and 0-9
a - 26 characters: a-z
0 - 10 characters: 0-9
Omni-5 Omni-6 Omni-7
*
**
*** *****
**** ***** ******
***** ****** *******
MMMMMM MMMMMMM MMMMMMMM
Mnnnnnn Mnnnnnnn Mnnnnnnnn
maaaaaaa maaaaaaaa maaaaaaaaa
00000000 000000000 0000000000
000000000 0000000000 00000000000
0000000000 00000000000 000000000000
000000000000 0000000000000
00000000000000
maaa0000 maaaa0000 maaaaa0000
maaaa000 maaaaa000 maaaaaa000
maaaaa00 maaaaaa00 maaaaaaa00
maaaaaa0 maaaaaaa0 maaaaaaaa0
maaaa0000 maaaaa0000 maaaaaa0000
maaaaaa000 maaaaaaa000
maaaaaaaa00 (maybe, this one is 40.31% of
the total key space so will see)