Hi,
I use a C program that build password guesses based on the following rule:
In the moment I pipe those generated password candidates to oclHashCat in stdin mode, most of them will be rejected because the candidates are too long.
What can I do about it?
I use a C program that build password guesses based on the following rule:
Code:
email:pw:username:SOME_VERY_LONG_CONSTANT
Here an invented example:
user0@example.org:123456:user0:aSDJv934upvjsdpu24r8gu3490503475345jklvsdhshdklfhjsdilfjsldflsdfklsdfkljsdlkfklsdjfklsdjfksdjfklsdjfjklsdhfjsdhfsdfsdfsdsad234tb
user1@provider.org:123456:user1:aSDJv934upvjsdpu24r8gu3490503475345jklvsdhshdklfhjsdilfjsldflsdfklsdfkljsdlkfklsdjfklsdjfksdjfklsdjfjklsdhfjsdhfsdfsdfsdsad234tb
user2@another.:123456:user2:aSDJv934upvjsdpu24r8gu3490503475345jklvsdhshdklfhjsdilfjsldflsdfklsdfkljsdlkfklsdjfklsdjfksdjfklsdjfjklsdhfjsdhfsdfsdfsdsad234tbIn the moment I pipe those generated password candidates to oclHashCat in stdin mode, most of them will be rejected because the candidates are too long.
Code:
cat dictionary.dict | ./myCprogram | ./oclHashCat64.bin somehashes.md5What can I do about it?