is it a???

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+2 votes

Plz tell me how to solve this .I am feeling problem o calculate --

10 = p^5 mod 35 . How to solve this type of question quickly.

+2 votes

Best answer

Given n = 35, that means p and q must be 5 and 7

Now we need to calculate $\phi$(n) = (p - 1) (q - 1)

Therefore $\phi$(n) = 24

Now we need to select e and d in such a way that (e x d) mod $\phi$(n) = 1

Given e = 5

i.e ( 5 x d ) mod 24 = 1

Going by options only option a satisties i.e d = 5 { 25 mod 24 = 1 }, So private key will be (5, 35).

Now we need to calculate $\phi$(n) = (p - 1) (q - 1)

Therefore $\phi$(n) = 24

Now we need to select e and d in such a way that (e x d) mod $\phi$(n) = 1

Given e = 5

i.e ( 5 x d ) mod 24 = 1

Going by options only option a satisties i.e d = 5 { 25 mod 24 = 1 }, So private key will be (5, 35).

0 votes

Option A is correct.here public key(e =5,n=35) so we first choose two distinct prime number p and q such that n = p *q. So we find p=7 and q=5, now we will have to find phi(n)=p-1 * q-1 = 6*4=24.

So public key is given (e=5,n=35),now we will find 5*d mod 24 =1.on checking options d=5 satisfy the remainder 1....

So (5,35) is the answer.

So public key is given (e=5,n=35),now we will find 5*d mod 24 =1.on checking options d=5 satisfy the remainder 1....

So (5,35) is the answer.

- All categories
- General Aptitude 1.4k
- Engineering Mathematics 6k
- Digital Logic 2.3k
- Programming & DS 4.3k
- Algorithms 3.7k
- Theory of Computation 4.6k
- Compiler Design 1.7k
- Databases 3.4k
- CO & Architecture 2.9k
- Computer Networks 3.4k
- Non GATE 1.2k
- Others 1.3k
- Admissions 506
- Exam Queries 482
- Tier 1 Placement Questions 22
- Job Queries 64
- Projects 16

40,976 questions

47,609 answers

146,779 comments

62,342 users