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).
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
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...
This laboratory assignment involves implementing a data structure called a map. A map associates objects called...
This laboratory assignment involves implementing a data structure called a map. A map associates objects called keys with other objects called values. It is implemented as a Java class that uses arrays internally. 1. Theory. A map is a set of key-value pairs. Each key is said to be associated with its corresponding value, so there is at most one pair in the set with a given key. You can perform the following operations on maps. You can test if...
Complete a Java program named ARMgr that maintains customer accounts receivable in a database. The code...
Complete a Java program named ARMgr that maintains customer accounts receivable in a database. The code to initialize the CustomerAccountsDB database table and add a set of customer accounts is provided. Finish the code in these 3 methods in CustomerAccountDB.java to update or query the database: -purchase(double amountOfPurchase) -payment(double amountOfPayment) -getCustomerName() Hint: For getCustomerName(), look at the getAccountBalance() method to see an example of querying data from the database. For the purchase() and payment() methods, look at the addCustomerAccount() method...
Java question, Please answer everything. Thank you Answer the following questions as briefly (but completely) as...
Java question, Please answer everything. Thank you Answer the following questions as briefly (but completely) as possible: What is a checked exception, and what is an unchecked exception? What is NullPointerException? Which of the following statements (if any) will throw an exception? If no exception is thrown, what is the output? 1: System.out.println( 1 / 0 ); 2: System.out.println( 1.0 / 0 ); Point out the problem in the following code. Does the code throw any exceptions? 1: long value...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT