A homogeneous parallel brute force cracking algorithm on the GPU

Vu, Anh-Duy; Han, Jea-Il; Nguyen, Hong-An; Kim, Youngman; Im, Eun-Jin

doi:10.1109/ictc.2011.6082661

Cited by 10 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Anh-Duy et al [17] proposed a homogeneous parallel brute force algorithm that utilizes the GPU to crack passwords. They used the CUDA framework 3.0 to crack SHA1.…”

Section: Literature Reviewmentioning

confidence: 99%

Password Cracking with Brute Force Algorithm and Dictionary Attack Using Parallel Programming

Alkhwaja,

Albugami,

Alkhwaja

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

Studying password-cracking techniques is essential in the information security discipline as it highlights the vulnerability of weak passwords and the need for stronger security measures to protect sensitive information. While both methods aim to uncover passwords, both approach the task in different ways. A brute force algorithm generates all possible combinations of characters in a specified range and length, while the dictionary attack checks against a predefined word list. This study compares the efficiency of these methods using parallel versions of Python, C++, and Hashcat. The results show that the NVIDIA GeForce GTX 1050 Ti with CUDA is significantly faster than the Intel(R) HD Graphics 630 GPU for cracking passwords, with a speedup of 11.5× and 10.4× for passwords with and without special characters, respectively. Special characters increase password-cracking time, making the process more challenging. The results of our implementation indicate that parallel processing greatly improves the speed of password-cracking techniques. The brute force algorithm achieved a speedup of 1.9× with six cores, while the dictionary attack showed a speedup of 4.4× with eight-core static scheduling. Studying password-cracking techniques highlights the need for stronger security measures to protect sensitive information and the vulnerability of weak passwords.

show abstract

“…Anh-Duy et al [17] proposed a homogeneous parallel brute force algorithm that utilizes the GPU to crack passwords. They used the CUDA framework 3.0 to crack SHA1.…”

Section: Literature Reviewmentioning

confidence: 99%

Password Cracking with Brute Force Algorithm and Dictionary Attack Using Parallel Programming

Alkhwaja,

Albugami,

Alkhwaja

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…In the software implementation, traditional password recovery based on the CPU architecture is limited by its computational speed for cryptographic algorithms and can crack only passwords with low complexity. For GPUs, highthroughput password recovery algorithms such as SHA1 and MD5 are implemented by means of multicore parallel computing [7]- [9]. However, the GPU has high power consumption and a low energy efficiency ratio.…”

Section: Introductionmentioning

confidence: 99%

Reconfigurable and High-Efficiency Password Recovery Algorithms Based on HRCA

Feng

Chen

et al. 2021

IEEE Access

View full text Add to dashboard Cite

Cryptographic algorithms are widely used in information security fields such as network protocol authentication and commercial encryption software. Password recovery based on the hash algorithm is an important means of electronic forensics, encrypted information restoration, illegal information filtering, and network security maintenance. The traditional password recovery system is based mainly on the CPU and GPU and has a low energy efficiency ratio and cracking efficiency and cannot meet highperformance computing requirements. To further improve the computational efficiency and application flexibility of password recovery algorithms, this paper proposes a reconfigurable computing kernel design method based on a hybrid reconfigurable computing array (HRCA). Through in-depth analysis of the hash algorithm, the basic computing kernel set is extracted, and the combination design is carried out from the unit kernel, interconnection and storage structure to reconstruct the hash algorithm to match the application with the appropriate structure. Second, combined with the pipeline technology, the full pipeline hash and high-speed password attack algorithms are optimized and implemented to meet the needs of highperformance computing. Finally, an advanced computing kernel library is established, and the combination of a computing kernel map from the control and communication levels to achieve multidimensional reconfigurable computing and an overall placement strategy is used to make full use of the chip resources to improve computational efficiency. The experimental results and analysis show that compared with traditional CPU and GPU methods, the password recovery algorithm designed in this paper has the highest cracking speeds at 78.22 times and 2.65 times that of the CPU and GPU, respectively, and the highest energy efficiency ratio is 25.88 times and 3.16 times that of the CPU and GPU, respectively. Furthermore, the recovery efficiency has been significantly improved and meets the requirements of high-performance password recovery computing.

show abstract

“…Our setup paves the way for future developments in the field of experimental high-dimensional QKD.Theft of electronic information is a major problem in modern telecommunications. For instance, recent advances in computing technology such as the ever growing parallel processing power of graphical processing units (GPUs), have allowed the brute-force cracking of passwords to be greatly sped up [1,2]. A very promising solution to the issue of information security is quantum key distribution (QKD), also called quantum cryptography [3].…”

mentioning

confidence: 99%

Quantum key distribution session with 16-dimensional photonic states

Etcheverry

Cañas

Gómez

et al. 2013

Sci Rep

125

View full text Add to dashboard Cite

The secure transfer of information is an important problem in modern telecommunications. Quantum key distribution (QKD) provides a solution to this problem by using individual quantum systems to generate correlated bits between remote parties, that can be used to extract a secret key. QKD with D-dimensional quantum channels provides security advantages that grow with increasing D. However, the vast majority of QKD implementations has been restricted to two dimensions. Here we demonstrate the feasibility of using higher dimensions for real-world quantum cryptography by performing, for the first time, a fully automated QKD session based on the BB84 protocol with 16-dimensional quantum states. Information is encoded in the single-photon transverse momentum and the required states are dynamically generated with programmable spatial light modulators. Our setup paves the way for future developments in the field of experimental high-dimensional QKD.

show abstract

A homogeneous parallel brute force cracking algorithm on the GPU

Cited by 10 publications

References 0 publications

Password Cracking with Brute Force Algorithm and Dictionary Attack Using Parallel Programming

Password Cracking with Brute Force Algorithm and Dictionary Attack Using Parallel Programming

Reconfigurable and High-Efficiency Password Recovery Algorithms Based on HRCA

Quantum key distribution session with 16-dimensional photonic states

Contact Info

Product

Resources

About