8. (20 pts)
a. RSA encryption. Let n = pq = (7)(17) = 119 and e = 5 define a
(very modest) RSA public key encryption. Since 25 < 119 <
2525, we can only encode one letter (two digit representation) at a
time. Use the function ? = ? mod ? to encode the word MATHY into a
series of five numbers that are less than n.
b. To decrypt an RSA encrypted message, we need to find d,...
These questions are about math cryptography
1) Encrypt the plaintext "this is a secret message" using the
affine function
f(x) = 5x + 7 mod 26.
2) Determine the number of divisors of 2n, where n is a positive
integer.
a) In a public-key system using RSA, n=77 and its public key is
e=23. What is the private key d? Show your steps of
calculation.
b) Let M=3. Compute its cipher text under the above RSA. Please
use the divide conquer algorithm to compute the exponential
function for the cipher text.
Write a Java program to encrypt the following message using the
RC4 cipher using key CODES:
Cryptography is a method of protecting information and
communications through the use of codes so that only those for whom
the information is intended can read and process it.
Instead of using stream length 256, we will use length 26. When
encrypting, let A = 0 to Z = 25 (hence CODES = [2 14 3 4 18]).
Ignore spaces and punctuations and put...
Alice is sending message “HIDE” to Bob. Perform encryption and
decryption using RSA algorithm, with the following information:
parameters p=11,q=5, e=7
Present all the information that you will need to encrypt and
decrypt only the first letter from text
Assume p = 13, q = 7, e = 11 and message m = 46.
1) Can given e be suitable for public key? Give reason why.
2) Find d = e-1 if e is suitable.
3) Perform encryption on the message m using RSA algorithm.
4)Perform decryption on the ciphertext c = 56 using the RSA
algorithm.
5) is c = 56, the ciphertext for the message m = 46?
QUESTION 26
Consider RSA with p = 7 and q = 11. What are n and z?
n
z
4 points
QUESTION 27
Put the following wireless encryption protocols in order from
most secure to least secure.
- 1.
2. 3.
WPA
- 1.
2. 3.
WEP
- 1.
2. ...