Optimizing the Computation of Hash Algorithms as an Attacker
Author(s): Jens Steube [atom]

Date: July 2013
Publication: Passwords13 Las Vegas
Source 1: https://hashcat.net/events/p13/js-ocohaaaa.pdf

Details are presented that explain how Hashcat optimizes the computation of MD5, NTLM, SHA1, PBKDF2 etc.

Most hash algorithms are designed to generate digests of large data inputs, but many developers use them to store passwords. By doing this, all hash algorithms can be optimized in some way to compute the hashes for password cracking; some more, some less.

I'll show some general optimization techniques and how they are used in Hashcat, which is what makes Hashcat fast.

PasswordResearch.com Note: Video of presentation available: https://www.youtube.com/watch?v=SEiL9fqcEwk

Do you have additional information to contribute regarding this research paper? If so, please email siteupdates@passwordresearch.com with the details.

<-- Back to Authentication Research Paper Index

[Home] [About Us] [News] [Research]

Copyright © 2016 PasswordResearch.com