ABSTRACT
In cryptography, information is safeguarded using secure methods of encryption such as AES (Advanced Encryption Standard), DES, Blowfish. It uses keys of varying sizes like 128, 192, or 256 bits and more to preserve information. Moreover, decryption without the actual key is not possible in this case because the total number of possible key combinations which exist makes a brute force attack impossible and infeasible. This paper showcases a new decryption tool which is designed to reduce the decryption time taken using a brute-force method through parallel processing and grammar validation. The tool disperses the decryption work into several threads and checks every decryption attempt for grammatical correctness so that only meaningful decrypted texts are returned. This allows for a significant increase in the speed of the process by allowing simultaneous searches through different sections of the keyspace. The paper details the architecture of the tool, its algorithms, and the gains made in terms of parallel processing over the traditional brute-force technique. Significant improvements have been found over the traditional brute-force techniques in terms of speed and usability. It contributes to UN Sustainable Development Goals 9, 16, and 4 by providing strong technological infrastructure, strengthening data protection for institutions, and advancing education in cybersecurity and cryptography. In this way, the tool serves not only to meet practical needs in processing secure data but also to contribute to the development of secure, resilient technology environments that are important to modern industries, public institutions, and STEM education.
