Title :
Usage of botnets for high speed MD5 hash cracking
Author_Institution :
Dept. of Comput. Sci. & Eng., Anna Univ., Chennai, India
Abstract :
Cryptographic Hash functions find ubiquitous use in various applications like digital signatures, message authentication codes and other forms of digital security. Their associated vulnerabilities therefore make them a prevalent target for cyber criminals. Cracking a hash involves brute force which is generally extremely time or computing power intensive. Recent times have seen usage of GPUs for brute forcing hashes thus significantly accelerating the rate of hash generation during brute force. This has further been extended to simultaneous usage of multiple GPUs over multiple machines or building GPU clusters having multiple GPUs on a single machine. Attackers use these methods to crack hashes within practical durations of time, to the tune of hours or days, depending on the strength of the password. This paper quantifies the advantage of using the CPU simultaneously with the GPU for hash cracking and describes how a potential attacker, with respect to the size of the botnet used, could come to possess capabilities of hash rates of at least greater than 11 times the rate of the world´s fastest GPU cluster based MD5 brute forcing machine with no investment.
Keywords :
computer crime; cryptography; digital signatures; graphics processing units; invasive software; GPU clusters; MD5 brute forcing machine; associated vulnerability; botnets; brute force; computing power intensive; cryptographic hash functions; cyber criminals; digital security; digital signatures; hash generation; high speed MD5 hash cracking; message authentication codes; multiple machines; time power intensive; Central Processing Unit; Computers; Dictionaries; Force; Graphics processing units; Peer-to-peer computing; Servers; Botnet computing; MD5 Hash cracking; combined usage of CPU and GPU for hash cracking;
Conference_Titel :
Innovative Computing Technology (INTECH), 2013 Third International Conference on
Conference_Location :
London
Print_ISBN :
978-1-4799-0047-3
DOI :
10.1109/INTECH.2013.6653658