Discussion
What is value of Euler's Phi function in RSA if the primes are 7 and 11 ?
Answer: B
Euler's phi of n is 60.
In RSA, n = pq, and for two distinct primes Euler's totient is the count of numbers below n that share no factor with it:
\[ \begin{aligned} n &= 7 \times 11 = 77 \\ \phi(n) &= (p - 1)(q - 1) \\ &= 6 \times 10 = 60 \end{aligned} \]
The public exponent e is then chosen coprime to 60, and the private exponent d is its inverse modulo 60. 77 is the modulus n itself, not φ(n), and 7 and 11 are just the primes.
No comment is present. Be the first to comment.
Loading…
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development