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.

Consider a 64 bit Block Encryption algorithm E. Suppose you have encrypted a 64 byte message Mı, M2, .. M64. Show / explain using diagrammatic forms how you would decrypt the message using CBC and OFB-16. Use an 8 byte IV: I1, I2, ... Is.

Answer quickly, in 10 min. Otherwise i will downvote.

-)Consider the code C = {000000, 000011, 001100, 001111, 110000, 110011, 111100, 111111} of n-bit binary strings. Select all that are true: answers;   |C| = 8   Δ(000000, 111111) = 6   n = 3   minimum distance is 2   can detect 2 errors   can correct 1 error

Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzi. Suppose you have an LFSR with 6 state bits. The first 12 bits of output produced by this LFSR are 101011100010 = 80818283848586878889810811- The first bit produced is the leftmost bit and the bit most recently produced is the rightmost bit. a) What is the initial state of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent 85 = 0, $4 = 1, 83 = 0, 82 = 1, 81 = 0, 80 = 1). b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent p = 0, P₁ = 1, P3 = 0, P2 = 1, P₁ = 0, Po = 1).

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.

Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. We conduct a known-plaintext attack against an LFSR. Through trial and error we have determined that the number of states is m = 4. The plaintext given by 01100101 —D ХоXјX2XҙX4X5X6X7 when encrypted by the LFSR produced the ciphertext 10010100 — Уo У1 У2 Уз Уз У5 У6 Ут- What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 0101 to represent P3 = 0, p2 = 1, Pi = 0, po = 1).

Please give me a step by step solution for this question, using only the regular c-instructions offered with hack assembly language.

The ROT-13 algorithm encrypts a string one character at a time by adding 13 to the value of the internal representation of the character. We want our encryption scheme to cover the entire printable ASCII range. After examining the ASCII character set and their internal representations, we see that characters 0 through 32 and character 127 are control characters. Technically, characters 32 (space) and 127 (DEL) are printable, but we don’t want to include them in our encryption routine. Therefore, we want our encrypted string to only contain characters in the range of 33 through 126. As an example:   Plaintext:              Norwich Ciphertext:                        [|!&vpu   The internal representation of ‘N’ is 78. 78 plus 13 is 91, which is the character ‘[‘. The internal representation of ‘o’ is 111. 111 plus 13 is 124, which is the character ‘|’. The internal representation of ‘r’ is 114. 114 plus 13 is 127. Since 126 is our maximum value for our desired printable range, we…