[zinzeur]

I have an idea : we generate all possibe combinations of up to 8 chars , and then we construct dictionnary for their hashes, this way we if we have an entity with 8 char length we are able to get it fast, any thougths ?
number of printable chars = 95
numbers of combinations : 95 ^8 = 6,634,204,312,890,625
average time for md5 hash (python ) = 0.001386
time = 9,195,051,448,886 s
Definitely we need distributed computing + mutli threading

[joepa]

You can do this in runtime with a single GPU

---

Or if you haven't got a GPU, check https://freerainbowtables.com/.

[zinzeur]

You can do this in runtime with a single GPU

---

Or if you haven't got a GPU, check https://freerainbowtables.com/.

yeah just found that the idea is already implemented by rainbow tables

[joepa]

yeah just found that the idea is already implemented by rainbow tables

LOL so that seems to be ~20 years ago. Now even the tables are not needed, at least for fast algos like md5 and sha*...