Abstract

In today's world, information drives not only business but nearly every aspect of human life. Therefore, safeguarding valuable information from malicious activities like attacks has become essential. Brute force search and dictionary attacks are prevalent cybersecurity threats, in which an attacker systematically attempts all possible passwords and passphrases to gain access to a user's account. These types of attacks are common due to the widespread reuse of simple password variations. The goal of this study is to discover as many passwords as possible and demonstrate their predictability and susceptibility. Our focus was on comparing two cracking methods, such as brute force search attacks and dictionary attacks, assessing their effectiveness and time requirements.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.