cracking DES with fixed plaintext
Hello everyone,
I'm trying to create rainbow table to cracking DES.
I have a fixed plaintext P, given a ciphertext the task is finding key that was used to encrypt P.
I already read about Hellman, DP, rainbow table method, and i tend to create rainbow table. I've figured out parameters for my table.
But, my problems now is none existing implementation that support to build it (as my search).
Does anyone have an idea?
Thanks for reading.
Well, are you aware that you have to create a new table for each Plain-Cypher combination?
Good luck with that...

By the way this is forum is about hashcat not rainbow tables.