p = 137
q = 151
n = p * q
= 137 * 151
= 20687
modulus n = 20687
phi (
)
= (p – 1) * (q – 1)
= (137 – 1) * (151 – 1)
= 136 * 150
= 20400
totient function phi (
)
= 20400
ed = 1 mod
where e = 11 and
= 20400
11 * d = 1 mod 20400
i.e, (11 * d) % 20400 = 1 (if we divide (11 * d) by 20400, remainder will be 1)
i.e, 11 * d = 20400 + 1
i.e, 11 * d = 20401
i.e, d = 20401 / 11
= 1854
Value of d = 1854
QUESTION 4 137 and 151 are assigned to p and q respectively to generate a pair...
Discrete Structures problem
Suppose we use p = 7 and q = 5 to generate keys for RSA. a) What is n ? b) What is on)? c) One choice of e is 5. What are the other choices for e? d) Explain how you got your answer for part c. e) For the choice of e = 5 what is d? Show work. f) Using the public key (n, e), what is the message 3 encrypted as? Show work...
Suppose we use p = 7 and q = 5 to generate keys for RSA. a) What is n ? ___________________ b) What is φ(n) ? _______________________ c) One choice of e is 5. What are the other choices for e? _________________________________________________________________________________ d) Explain how you got your answer for part c. e) For the choice of e = 5 what is d? _________________________ Show work. f) Using the public key (n, e), what is the message 3 encrypted as?...
Suppose that you are computing an RSA key pair. (Marks 6) What are ? and ? and ?(?) for an ? = 51? Find a legal RSA public key pair for this ? and ?. How many possible values for ?? are there? In a RSA cryptosystem, a person Renee uses two prime numbers p = 13 and q = 17 to generate her public and private keys. If the public key of Renee is 35, then the...
In a RSA cryptosystem, a participant A uses two prime numbers p = 13 and q = 17 to generate her public and private keys. If the public key of A is 35, then the private key of A is 11. Alice wants to encrypt a message to Bob by using the RSA algorithm and using keys in (A) The plaintext = “HI”. Answer: _______________
Perform encryption using the RSA algorithm. Given p=5, q=11, e=3, M=9, determine the following: modulus n = , t = , private key d = , ciphertext c = (Note: Choose the smallest value "d" that works) If M is changed to M=40, the new ciphertext value becomes c =
If we choose two prime numbers p=13 and q=17 in RSA (Rivest-Shamir-Adelman) algorithm, and choose Public Key = (p x q, e) = (221,5), (a) Show the result and procedures to generate Private Key. (b) Show the procedures using the Public Key and the Private Key found in step (a) to encrypt a message M (Assume M=25); and to decrypt for obtaining the message.
This is the prompt then the question asks, "What is the
ciphertext for the word LODE? (Simplify your answers completely.
Enter your answers as a comma-separated list.)"
Please help I have been stuck for hours.
In public key cryptography, there are two keys created, one for encoding a message (the public key) and one for decoding the message (the private key). One form of this scheme is known as RSA, from the first letters of the last names of Ron...
DISCRETE MATH
If the public key e = 11, and p = 3, q = 5. What is the private key d?
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)....
Choose 2 large primes, p and q. Normally, these would be
randomly distributed, but for this assignment choose primes 10^11
and 10^12. Generate the first part of your public key n = pq.
WILL THUMBS UP FOR BEST ANSWER