Question

p = 13 q = 37 Totient = 432 n = 481 e = 19 d...

p = 13

q = 37

Totient = 432

n = 481

e = 19

d = 91

public key: n = 481, e = 19

private key: n= 481, d = 91

Except 1, explain any other prime number less than e which cannot be used to generate d? What are those number and why they cannot be used?

Homework Answers

Answer #1

Ans: 3 and 5 numbers can't be selected as e

Here p=13 , q=37 and n=p*q=13*37=481 and Totient=(p-1)*(q-1)=432

And given that e=19 and d=91

now,

Public key : n=481 ,e=19

Private key: n=481 , d=91

Now,

The prime numbers less than e=19 are 2,3,5,7,11,13,17

For selecting e , there are two conditions i.e, GCD(e,Totient)=1 and 1<e<Totient

second condition is not required here, because here we are taken prime numbers upto 20 only,

Now we have to check for the numbers which satisfy GCD(e,Totient)=1

Here 2 can't be selected because GCD(2,432)=2

3 can't be selected because GCD(3,432)=3

5 can be selected because GCD(5,432)=1

7 can be selected because GCD(7,432)=1

11 can be selected because GCD(11,432)=1

13 can be selected because GCD(13,432)=1

17 can be selected because GCD(17,432)=1

Therefore,

3 and 5 are the numbers which can't be selected as e

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Write public and private key where p = 13, q = 37 and n = 481....
Write public and private key where p = 13, q = 37 and n = 481. Totient is 432. E is 19 and d is 91. Write public key as (n = , e =) and private key as (n = , d =)
Let p=11, q=17, n = pq = 187. Your (awful) public RSA encryption key is (e=107,...
Let p=11, q=17, n = pq = 187. Your (awful) public RSA encryption key is (e=107, n=187). (a) What is your private decryption key? (b) You receive the encrypted message: 100 Decrypt the message. (In other words, what was the original message, before it was encrypted? Just give me a number, don’t convert it to letters).
Below is an example of key generation, encryption, and decryption using RSA. For the examples below,...
Below is an example of key generation, encryption, and decryption using RSA. For the examples below, fill in the blanks to indicate what each part is or answer the question. Public key is (23, 11) What is 23 called? _______________, What is 11 called?_______________ Private key is (23, 13) What is 23 called?_______________, What is 13 called?_______________ 23 can be part of the public key because it is very hard to _______________ large prime numbers. ENCRYPT (m) = m^e mod...
Q1: Sara is using RSA crypto-system with the following setup: p = 11 and q =...
Q1: Sara is using RSA crypto-system with the following setup: p = 11 and q = 3. Sara publish his Public Key: (n, e) = (33, 3). d. Deem wants to set up his own public and private keys. She chooses p = 23 and q = 19 with e = 283. Find her private and public keys. Note show all steps to find the good value for d.
Samantha uses the RSA signature scheme with primes p = 13 and q = 23 and...
Samantha uses the RSA signature scheme with primes p = 13 and q = 23 and public verification exponent v = 53. (a) What is Samantha’s public modulus? What is her private signing key? (b) Samantha signs the digital document D = 100. What is the signature?
Discrete Math: decipher the following: 392466 600311 599633 where the public key is (950141,11), 950141=p*q 11=e...
Discrete Math: decipher the following: 392466 600311 599633 where the public key is (950141,11), 950141=p*q 11=e and the private key (d) is 603395
QUESTION 19 A key distribution and authentication method used by every operating system. It uses a...
QUESTION 19 A key distribution and authentication method used by every operating system. It uses a shared secret key and can also be used for single sign-on operations. 2 points    QUESTION 20 Authentication method that allows a user to authenticate once and use multiple services without having to re-authenticate. 2 points    QUESTION 21 Protocol that establishes the security association for the Authentication Header (AH) or the Encapsulating Security Payload (ESP) in IPsec, and provides keys for both AH...
Imagine I chose 10-digit prime numbers p,q and r, such that n=pqr happened to be a...
Imagine I chose 10-digit prime numbers p,q and r, such that n=pqr happened to be a Carmichael number. Write down an exact formula for the probability that a random a∈ {0,1, . . . , n−1} detects the compositeness of n when used in Fermat’s compositeness test. That is, how many of these a fail to satisfy a^(n−1)≡1 modn. Show that the probability that a random a will detect the compositeness of n is less than 1 in a billion
Consider permutations of the 26-character lowercase alphabet Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}. In how many of these permutations do a,b,c...
Consider permutations of the 26-character lowercase alphabet Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}. In how many of these permutations do a,b,c occur consecutively and in that order? In how many of these permutations does a appear before b and b appear before c?
2. Which of the following is a negation for ¡°All dogs are loyal¡±? More than one...
2. Which of the following is a negation for ¡°All dogs are loyal¡±? More than one answer may be correct. a. All dogs are disloyal. b. No dogs are loyal. c. Some dogs are disloyal. d. Some dogs are loyal. e. There is a disloyal animal that is not a dog. f. There is a dog that is disloyal. g. No animals that are not dogs are loyal. h. Some animals that are not dogs are loyal. 3. Write a...