02-19-2017, 02:55 AM
(This post was last modified: 02-19-2017, 02:55 AM by tom.schneider.)
Hello,
i was playing around with hashcat especially the des mode.
what was making me curious, if use a generated test vector with 5000, 10000 and 2000 random key/plain/cipher blocks
on my test hardware(hd7870) it takes around 3 years for each to complete, but the same is true for a set with 5x10^6
also the keyspace progress is about same.
from my understanding there would be a significant difference.
because if we test a key against plain or cipher (encode/decode) key expansion and IP just needs to be calculated
ones and can be used in every thread but for the 16 rounds of F we need either plaintext or cipher and with this we need to iterate over every single block.
even with many gpu cores and bit slicing, the difference is for my knowledge to big for the same results.
can some one please point out how this is possible?
-m 14000 des.vector -o our.txt -a 3 -1 charsets/DES_full.charset --hex-charset ?1?1?1?1?1?1?1?1 -w 4
i was playing around with hashcat especially the des mode.
what was making me curious, if use a generated test vector with 5000, 10000 and 2000 random key/plain/cipher blocks
on my test hardware(hd7870) it takes around 3 years for each to complete, but the same is true for a set with 5x10^6
also the keyspace progress is about same.
from my understanding there would be a significant difference.
because if we test a key against plain or cipher (encode/decode) key expansion and IP just needs to be calculated
ones and can be used in every thread but for the 16 rounds of F we need either plaintext or cipher and with this we need to iterate over every single block.
even with many gpu cores and bit slicing, the difference is for my knowledge to big for the same results.
can some one please point out how this is possible?
-m 14000 des.vector -o our.txt -a 3 -1 charsets/DES_full.charset --hex-charset ?1?1?1?1?1?1?1?1 -w 4