This question is the same one I asked here. Since I haven't got any response or even a comment I will post it here as well.

Is there any naive implementation of Hellman's cryptanalytic time memory tradeoff in C and/or a naive implementation of Oechslin's rainbow table algorithm in C as well?

I have seen some implementations of rainbow table but they are always focused on being fast through the usage of assembly-level operations or being designed to work on a specific platform such as CUDA or FPGAs.

  • 4
    The reason you see implementations in CUDA or FPGAs is because the algorithms can be highly optimized for speed and efficiency for real world applications. You could try looking for UPC implementations, but initial searches for me turned up nothing. – RoraΖ Mar 24 '15 at 11:18
  • @raz Yes, I have researched for some time now, still nothing. My hope is that someone have this code but haven't shared with the world yet. – Frederico Schardong Mar 24 '15 at 12:40
  • I found some straight forward implementations in C on github but no luck with Hellman`s table – Frederico Schardong Mar 26 '15 at 0:42
  • 1
    why do you need it in C? – Purefan May 24 '16 at 12:12

Please take a look at the article - it's about naive implementation of Rainbow Tables for cracking MD5 hash function. It also has sources attached to the article. The main drawback - it's in Russian, but Yandex.Translate or Google Translate can easily cope with it.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.