Triples Des passkey finder

[Look]

Hello, to all. I want ask you it is posible to find key for triple des (3Des) or TDEA algorithm.
Coding is "NIST 800-67", 3 keys, Key1 <>Key2 and Key1=Key3.
Data in 8 byte, data out 8 byte; have 3 samples
Thanks;

[atom]

It's still 112 bit then, I don't think so.

[Look]

It's still 112 bit then, I don't think so.

Yes is (key1+key2) (16 bytes * 8 bit) - 16 bit (lowest bytes) = 112 bits.
But 
1. EncryptDes(data,key1,0)  
2. DecryptDes(data,key2,0)
3. EncryptDes(data,key1, vector of encrypt) (it is not simple EncryptDes, it have leave vector of First Encrypt)

[atom]

I know, but even 80 bit would be too much

[Look]

I know, but even 80 bit would be too much

I make simple program to calculate key's, but calculations are very slow to check all keys need about 12000 years, maybe its is possible to make fastest algorithm on gpu, witch calculations take up to 1 year?

[atom]

You can expect ~10GH/s on a 1080.

[Look]

You can expect ~10GH/s on a 1080.

Try to compile the git hub version, on debian. compiling for linux - ok, compiling for win32 win64 - have problems in src/ potfile.c "sort_r" implicit declaration of function 'qsort_s'

[atom]

You can use Msys2 to compile on windows. Works very good, I use it myself.

[decoding2017]

what would the command be, and how would the plain-encrypted pairs be on file?