Processing Cryptanalysis of Hash Functions using Graphics Processing Units

Auditing communications in companies to verify their correct operation and to check that there is no illegal activity is quite often. The main problem is that the tools of audit are inefficient when communications are encrypted. A hash function is a deterministic function that irreversibly converts a variable-sized message block to a fixed length string. Hash functions are widely used in cryptographic applications such as digital signatures, message authentication codes, etc. Cryptographic primitives such as block ciphers, hash functions are such an integral part of everyday computing. There are hacking and cryptanalysis techniques that allow intercepting and auditing encrypted communications with a computational cost so high that it is not a viable application in real time. Moreover, the recent use of graphics processing unit (GPU) in high-performance servers is changing this trend. This article presents a comparative study among the implementation of brute force attacks and Rainbow tables generation. This study has been carried out with a sequential algorithm and three parallel algorithms, using threads, MPI and CUDA implementations. These programs were performed on a NVIDIA TESLA S1070, with four Tesla T10 processors each with a total of 960 cores of 1.44 GHz. Finally, we can say that CUDA has the best technology in brute force attacks while MPI presents the best results in the generation of Rainbow tables.