I need help for question 7 and question 8.


I need help for question 7 and question 8. 7. An RSA cryptosystem has modulus message m 180 to your friend whose public...
8. An RSA cryptosysten has modulus n-253, and you receive the encoded message m 236 which only you can read. Your secret decoding key d = 19, what is the decoded message m? (a) 108 (b) 183 (c) 64 (d) none of these.
8. An RSA cryptosysten has modulus n-253, and you receive the encoded message m 236 which only you can read. Your secret decoding key d = 19, what is the decoded message m? (a) 108 (b) 183...
6. An RSA cryptosystem has modulus n-299, which is a product of the primes 23 and 13. Your public encoding key e-59. What is your secret decoding key d? (a) 179 (b) 205 (c 214 (d) none of these.
6. An RSA cryptosystem has modulus n-299, which is a product of the primes 23 and 13. Your public encoding key e-59. What is your secret decoding key d? (a) 179 (b) 205 (c 214 (d) none of these.
Question 2 (compulsory) (a) Explain the operation of the RSA public-key cryptosystem (b) Illustrate your explanation by using the prim es p 13 and q 17 and secret decryption key d 103 to (i) decrypt the ciphertext z2; (ii) compute the public encryption key e corresponding to d (ii) encrypt the plaintext m-. (c) Discuss the security of the RSA public-key cryptosystem
Question 2 (compulsory) (a) Explain the operation of the RSA public-key cryptosystem (b) Illustrate your explanation by using...
(8) In an RSA cryptosystem, Bob’s public key is (n = 629, e = 43). Alice uses this public key to encrypt the word “MARCH” and send the ciphertext to Bob. First, she represents this word in ASCII where the capital letters A, B, C, . . . , X, Y, Z are represented by integers 65, 66, 67, . . . , 88, 89, 90 respectively. Then she encrypts the five integers that represent M, A, R, C, H...
5.6 Exercise. Describe an RSA Public Key Code System based on the primes and 17. Encode and decode several messages Of coursc, the fun of being a spy is to break codes. So get on your trench coal, pull out your magnifying glass, and begin to spy. The next exercise asks you to break an RSA code and save the world 5.7 Excrcise. You are a secret agent. An evil spy with shallow mumber thery skills uses the RSA Public...
Alice wants to send a message m to Bob using Rabin Cryptosystem. Bob makes the public key n = 77 and sends it to Alice. By using Rabin Cryptosystem, a) Alice encrypts her message m and sends the encrypted message c to Bob. What are the encrypted messages if m = 8, 36, 41 and 69? b) Alice encrypts her message m = 6 and sends the encrypted message c to Bob. Bob decrypts the message. What are the possible...
how would I go about this question?
4. You are part of the Cryptographic Security Team at a military facility, tasked with decoding messages as required. A message has come in from HQ, as an ordered collection of numbers, which is personalised for yourself and aimed at testing aspects of your decoding skills. 257463, 274522, 404592, 276548, 254934, 496676, 220303, 269786, 326504, 164977, 236038, 206659 These numbers (above) have each been encoded using RSA with a modulus of m-pq 520229...
2. Alice is a student in CSE20. Having learned about the RSA cryptosystem in class, she decides to set-up her own public key as follows. She chooses the primes p=563 and q = 383, so that the modulus is N = 21 5629. She also chooses the encryption key e-49. She posts the num- bers N = 215629 and e-49 to her website. Bob, who is in love with Alice, desires to send her messages every hour. To do so,...
(i) Find Bezout’s Identity for 53 and 61. Using RSA, you send Alice the modulus m = 3233 (= 53 · 61) and the encrypting exponent e = 7. Alice has a two-letter message that she turns into a number ≤ 2626 and encrypts and sends you. You receive c = 1067. You have already determined that the decrypting exponent is d = 1783. (ii) Find cd (mod 53) and cd (mod 61). (iii) Then use Bezout’s identity from (i)...
Use C++
forehand e receiver creates a public key and a secret key as follows. Generate two distinct primes, p andq. Since they can be used to generate the secret key, they must be kept hidden. Let n-pg, phi(n) ((p-1)*(q-1) Select an integer e such that gcd(e, (p-100g-1))-1. The public key is the pair (e,n). This should be distributed widely. Compute d such that d-l(mod (p-1)(q-1). This can be done using the pulverizer. The secret key is the pair (d.n)....