Aim: To implement and demonstrate the process of encrypting plaintext messages using the Caesar Cipher technique, where each letter is shifted by a fixed number of positions in the alphabet.
Aim: To implement and demonstrate the process of decrypting Caesar Cipher encrypted messages by applying the reverse shift operation to recover the original plaintext.
Aim: To implement and demonstrate the process of encrypting messages using the Vigenère Cipher, where each letter is encrypted using a different shift based on a repeating keyword.
Aim: To implement and demonstrate the process of decrypting Vigenère Cipher encrypted messages by applying the reverse shifts using the same keyword to recover the original text.
Aim: To implement and demonstrate the creation of a 5x5 Playfair Cipher grid using a keyword, including handling of the alphabet, special characters, and grid generation rules.
Aim: To implement and demonstrate a monoalphabetic substitution cipher where each letter in the plaintext is replaced with a unique letter from a scrambled alphabet to create the ciphertext.
Aim: To implement and demonstrate the XOR cipher encryption process, where each character of the plaintext is combined with a key using the XOR operation to produce the ciphertext.
Aim: To implement and demonstrate the SHA-256 hashing algorithm, showing how it processes input data through multiple rounds of compression to generate a 256-bit hash value.
Aim: To create an interactive visualization of the Diffie-Hellman key exchange process, demonstrating how two parties can securely establish a shared secret key through public channel communication.
Aim: To implement and demonstrate frequency analysis techniques for breaking substitution ciphers by analyzing and comparing the frequency distribution of letters in encrypted text with standard English letter frequencies.