GATE Computer Science (CS) 2019 Solved Papers

Question : 64 of 65

Marks: +1, -0

In an RSA cryptosystem, the value of the public modulus parameter

n

3007 .

If it is also known that

ϕ(n)=2880

, where

ϕ()

denotes Euler's Totient Function, then the prime factor of

n

which is greater than 50 is __________.

Solution:

{n}= {p} × {q}=3007

φ(n)=(p-1)(q-1)=2880

By RSA algorithm,

{n}=31 × 97

in which 97 is prime factor which greater than 50 .

Go to Question:

Prev Question

Next Question