If you are asking about the code changes you need to do to make this work, it would probably be better to discuss this in the developer section of this forum.
Feature request go directly to github (open a new github issue), but they need to be "justified" and it should be a feature from which many users would benefit. In addition to that it should contain all information listed here: https://hashcat.net/wiki/frequently_aske...plish_this
I will try to answer (in a very general way) your coding question:
1. it may be best to use the already available md5(md5($pass)) kernel e.g. see: https://github.com/hashcat/oclHashcat/bl...2610_a3.cl
2. based on that kernel you can do some final steps like seen here: https://github.com/hashcat/oclHashcat/bl...#L128-L135, e.g. that only some parts of the final output matches
3. the next step is to add a new parser s.t. the new length is respected and correctly parsed, or just modify/adjust the -m 2600 parser (if you just want to have a fast hack), see md5md5_parse_hash () in https://github.com/hashcat/oclHashcat/bl...d.c#L11220
If you just need the first few bytes, you do not need to check all substrings (like done in -m 2600, linked above, where the first, middle and last "hash part" is checked for a match).
BTW: I don't think that this is the correct place to give support for "how to hack the 2600 kernel", so if this information above is not enough for you, we should either think to move this thread to the devs section or to discuss (as mentioned above, given there is a "general interest about this algorithm") on github etc.
Thx
Feature request go directly to github (open a new github issue), but they need to be "justified" and it should be a feature from which many users would benefit. In addition to that it should contain all information listed here: https://hashcat.net/wiki/frequently_aske...plish_this
I will try to answer (in a very general way) your coding question:
1. it may be best to use the already available md5(md5($pass)) kernel e.g. see: https://github.com/hashcat/oclHashcat/bl...2610_a3.cl
2. based on that kernel you can do some final steps like seen here: https://github.com/hashcat/oclHashcat/bl...#L128-L135, e.g. that only some parts of the final output matches
3. the next step is to add a new parser s.t. the new length is respected and correctly parsed, or just modify/adjust the -m 2600 parser (if you just want to have a fast hack), see md5md5_parse_hash () in https://github.com/hashcat/oclHashcat/bl...d.c#L11220
If you just need the first few bytes, you do not need to check all substrings (like done in -m 2600, linked above, where the first, middle and last "hash part" is checked for a match).
BTW: I don't think that this is the correct place to give support for "how to hack the 2600 kernel", so if this information above is not enough for you, we should either think to move this thread to the devs section or to discuss (as mentioned above, given there is a "general interest about this algorithm") on github etc.
Thx