07-01-2016, 08:41 AM
Well, the most suitable answer would be just read the kernel's source code (of e.g. -m 9600) and convert it to python (that may also - be the only thing that - help to get an idea about the optimizations used by hashcat etc).
Otherwise, it is also always good to stick to the specs and public documents about the hashing algorithm used by office 2013 documents (the source that was also used to implement the format into hashcat).
But there exist even a more "understandable" hashing algorithm description in terms of source code within hashcat and that thing being: the test.pl implementation!
see https://github.com/hashcat/hashcat/blob/...5725-L5791
well it is a perl implementation, but this can very easily converted 1:1 to python (by just considering/changing the little differences that the two languages have). Also, why use python if you have a perl implementation
(I'm just kidding, there might be reasons for that, I guess)
Otherwise, it is also always good to stick to the specs and public documents about the hashing algorithm used by office 2013 documents (the source that was also used to implement the format into hashcat).
But there exist even a more "understandable" hashing algorithm description in terms of source code within hashcat and that thing being: the test.pl implementation!
see https://github.com/hashcat/hashcat/blob/...5725-L5791
well it is a perl implementation, but this can very easily converted 1:1 to python (by just considering/changing the little differences that the two languages have). Also, why use python if you have a perl implementation
(I'm just kidding, there might be reasons for that, I guess)