1. Perform encryption and decryption using the RSA algorithm for the following: a. p= 3;q=11;e=7;M=5 p=7;q=11;e=17;M=8 b.

Perform encryption and decryption using the RSA algorithm for the following. Show allyour steps.1. p = 3; q = 11, e = 7; M = 52. p = 5; q = 11, e = 3; M = 9

21. RSA problem: given plaintext P, e, prime numbers p, q, compute ciphertext C. Decrypt C and verify you get plaintext P back.

(c) The following table provides all possible block pairs of plaintext/ciphertext when using some block cipher E with a particular key K. Plaintext Ciphertext Plaintext 0000 1100 1000 1111 1001 0111 1010 1110 1011 1001 0010 1101 0001 0010 0011 0100 0101 0110 0111 1011 1100 1101 1110 1111 Ciphertext 0001 0000 0101 0100 0011 1000 0110 1010 Given that a plaintext P was encrypted using this block cipher operating in a counter mode starting with the counter value of 0, i.e. 0, 1, 2, ..., decrypt the ciphertext C = 010001110111.

Perform encryption and decryption using the RSA algorithm for the letter "S". Show all steps in details when p=5 , q=7 , e=5.

Chapter 8: Problem 9 Previous Problem Problem List Next Problem Results for this submission Entered 49 146 Answer Preview Result 49 146 incorrect incorrect At least one of the answers above is NOT correct. (1 point) Alice and Bob are using the ElGamal cipher with the parameters p = 193 and a = = 5. = = Alice makes the mistake of using the same ephemeral key for two plaintexts, x1 and x 2. The eavesdropper Eve suspects that x1 146. She sees the two ciphertexts y1 = 141 and y2 = = 167 in transit; these are the encryptions of x1 and x2, respectively. a) What is the masking key kм? 49 b) What is the plaintext x2 ? 146

Encrypt the first 4 letters of your last name as a block of data to be encrypted. (Let A=1, B=2, C=3,...Z=26). Decrypt the encrypted number to demonstrate that your system works.   lastname is john

A.Given p=25, q=9, and e=7, generate the public key (n,e) and the private key (n,d) using the RSA Key generation algorithm. (Use Excel for computations) b. Given Bob's public key of (85, 7) and private key of (85, 55), show how Alice can encrypt m=3 to send to Bob. Show the ciphertext. c. Given Bob's public key of (85, 7) and private key of (85, 55), show how Bob can decrypt the ciphertext y=2 received from Alice. Show the plaintext. d. Using the fast exponentiation method, determine 530 mod 47. Show your work.

In an RSA system, the public key (n,e) of a given user is (323, 11). 1. What is the value of the exponent in the private key (n, d), of this user? 2. Suppose you want to send this user the message m = 45, write down the expression to generate the ciphertext for this message. 3. Suppose that your ciphertext, c, is 5, write down the expression to generate the plaintext matching this ciphertext. 4. Can you encrypt the message m=322 with this public key? O a. Yes O b. No

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…