EnigmaX is a Java program that can be used to encrypt and decrypt messages. It applies a series of encryption algorithms to the user's input, including a Caesar cipher, XOR encryption, transposition cipher, one-time pad encryption, and modulo reduction.
To use EnigmaX, simply clone or download the repository and open the project in an IDE of your choice. You can then run the program from the Main class.
You must have Java installed on your computer in order to run this program.
- When you run the program, you will be prompted to enter whether you want to encrypt or decrypt a message.
Would you like to encrypt or decrypt a message? - If you choose to encrypt a message, you will then be prompted to enter the message you wish to encrypt and a key. The key determines the number of positions to shift each character in the message. The greater the key, the more secure the encryption.
Enter a message to encrypt:
Hello World
Enter a key:
3
- The program will then display the encrypted message.
Your new decryption key is: 4931 (prime number)
Your encrypted message is:
6123640476616101295013
- If you choose to decrypt a message (under development), you will be prompted to enter the message you wish to decrypt and the key that was used to encrypt it.
Enter a message to decrypt:
6123640476616101295013
Enter a key:
3
The program will then display the decrypted message.
Your decrypted message is:
Hello World
The EnigmaX program applies a series of encryption algorithms to the user's input. The following is a brief explanation of some of these algorithms.
The Caesar cipher is a simple substitution cipher that replaces each letter in the message with a letter that is a fixed number of positions down the alphabet. In EnigmaX, the Caesar cipher is implemented by shifting each character in the message a certain number of positions, which is determined by the key provided by the user.
XOR encryption is a simple encryption algorithm that applies the XOR (exclusive or) operator to the bits of the message and a random key. In EnigmaX, the XOR operator is applied to the binary representation of each character in the message and a key generated by the program.
Transposition ciphers are encryption methods that involve rearranging the order of the characters in the message. In EnigmaX, the transposition cipher is implemented by shuffling the order of the bits in the binary representation of each character in the message according to a key provided by the user.
One-time pad encryption is an encryption algorithm that uses a random key that is at least as long as the message being encrypted. In EnigmaX, the one-time pad encryption is implemented by applying the XOR operator to each character in the message and a key generated by the program.
Modulo reduction is a mathematical operation that reduces a number to its remainder after division by a given integer. In EnigmaX, the modulo reduction is applied to the ASCII value of each character in the message, using a prime number as the divisor.
Base64 is a binary-to-text encoding scheme that represents binary data in an ASCII string format. In EnigmaX, the base64 conversion is applied to the ASCII value of each character in the message.
Contributions to EnigmaX are welcome! If you find a bug or have an idea for a new feature, please create an issue or submit a pull request.
EnigmaX is licensed under the MIT license. See the LICENSE file for more details.
EnigmaX was created by Khosraw Azizi.