Verification via Shared Negative Password Encryption

Abstract

As the Internet has grown, it has led to the creation of a huge number of online services. Most people use password authentication because it is cheap and easy to set up. As a result, academics and businesses are constantly showing a great deal of interest in password security. Cracking a password is one of the most common types of cyber attacks used in today's world. Passwords are becoming more complex. For instance, many users choose passwords based on the language they use most often and then repeat those passwords across many sites. The attacker uses a number of techniques to get the credentials needed to steal sensitive data. These techniques include guessing the password, shoulder surfing, and other tools that are designed to break passwords. It is recommended that we use passwords that are highly encrypted and hashed to get around this problem. Since the hash function is combined with the encryption process, it is very difficult to distinguish passwords from ENPs. The investigation and comparison of algorithms show that the ENP cloud is resistant to attacks using lookup tables and provides a higher level of protection for a password when it is subjected to dictionary attacks. In this case, the process of developing a secure password involves two steps: first, the password is hashed, and then it is encrypted