For that, Koushik must derive his own public key and private key pair from the values p = 23 and q = 107, where p and q are the two prime numbers and select the coprime (e) and calculate d in the RSA algorithm. After key generation, Koushik shares his public key with his client. One of his clients encrypts the message "19" using Koushik's public key before he sends it to Koushik. Upon receiving it from clients, Koushik uses his private key to decrypt the cypher text. You explain how the message "19" is encrypted and decrypted

Alice and Bob use the ElGamal scheme with a common prime q= 131 and a primitive root a=6. Let Bob's public key be Yn=3. A. What is the ciphertext of M-9 if Alice chooses the random integer k=4? B. If Alice uses the same k to encrypt two messages M₁ and M₂ as (12, 65) and (12, 64), what is the relation between M₁ and M₂?

Alice and Bod have decided to use a symmetric encryption algorithm. They have some assumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical values of corresponding message and key letters are added together, modulo 26. For example, if the plain text is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), then for each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) Write a program in Python, C/C++ or JavaScript to…