In an RSA system the public key of a given user is e = 31, n = 3599. Whatis the private key of this user?(a) 3031(b) 2412(c) 2432(d) 1023This question was posed to me in a national level competition.Question is from Knapsack/ Merkle topic in section Public Key Cryptography and RSA of Cryptograph & Network Security

In an RSA system the public key of a given user is e = 31, n = 3599. W

1.	In an RSA system the public key of a given user is e = 31, n = 3599. Whatis the private key of this user?(a) 3031(b) 2412(c) 2432(d) 1023This question was posed to me in a national level competition.Question is from Knapsack/ Merkle topic in section Public Key Cryptography and RSA of Cryptograph & Network Security
Answer» Correct option is (a) 3031 To explain: By trail and error, we DETERMINE that p = 59 and Q = 61. HENCE f(n) = 58 x 60 = 3480. Then, using the extended Euclidean algorithm, we find that the multiplicative inverse of 31 modulo f(n) is 3031.

Discussion

No Comment Found

Related InterviewSolutions

In Merkle-Hellman Cryptosystem, the public key can be used to decrypt messages, but cannot be used to decrypt messages. The private key encrypts the messages.(a) True(b) FalseI have been asked this question in an online quiz.Asked question is from Knapsack/ Merkle topic in division Public Key Cryptography and RSA of Cryptograph & Network Security
Consider knapsack that weighs 23 that has been made from the weights of the superincreasing series {1, 2, 4, 9, 20, and 38}. Find the ‘n’.(a) 011111(b) 010011(c) 010111(d) 010010I had been asked this question in semester exam.This intriguing question originated from Knapsack/ Merkle in portion Public Key Cryptography and RSA of Cryptograph & Network Security
p = 7; q = 11; M = 8(a) 19(b) 57(c) 76(d) 59This question was posed to me in exam.I would like to ask this question from Knapsack/ Merkle in section Public Key Cryptography and RSA of Cryptograph & Network Security
For p = 11 and q = 19 and choose d=17. Apply RSA algorithm where Cipher message=80 and thus find the plain text.(a) 54(b) 43(c) 5(d) 24This question was addressed to me in an interview.This interesting question is from Knapsack/ Merkle in chapter Public Key Cryptography and RSA of Cryptograph & Network Security
In Merkle-Hellman Cryptosystem, the hard knapsack becomes the private key and the easy knapsack becomes the public key.(a) True(b) FalseThe question was posed to me in class test.Question is taken from Knapsack/ Merkle in division Public Key Cryptography and RSA of Cryptograph & Network Security
USENET falls under which category of public key sharing?(a) Public announcement(b) Publicly available directory(c) Public-key authority(d) Public-key certificatesThis question was addressed to me by my college director while I was bunking the class.I want to ask this question from Knapsack/ Merkle topic in section Public Key Cryptography and RSA of Cryptograph & Network Security
RSA is also a stream cipher like Merkel-Hellman.(a) True(b) FalseThe question was asked in examination.I want to ask this question from Knapsack/ Merkle in portion Public Key Cryptography and RSA of Cryptograph & Network Security
Set {1, 2, 3, 9, 10, and 24} is superincreasing.(a) True(b) FalseI had been asked this question in semester exam.My enquiry is from Knapsack/ Merkle topic in chapter Public Key Cryptography and RSA of Cryptograph & Network Security
Another name for Merkle-Hellman Cryptosystem is(a) RC4(b) Knapsack(c) Rijndael(d) Diffie-HellmanI have been asked this question during an interview.My question is taken from Knapsack/ Merkle in section Public Key Cryptography and RSA of Cryptograph & Network Security
Which Cryptographic system uses C1 = (e1^r) mod p and C1 = (e2^r x P) mod p at the encryption side?(a) Elgamal(b) RSA(c) Rabin(d) WhirlpoolThis question was posed to me in an international level competition.I would like to ask this question from Rabin/ Elgamal Algorithm in division Public Key Cryptography and RSA of Cryptograph & Network Security

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment