- #1
geoffrey159
- 535
- 72
Homework Statement
It is about an exercise called "RSA encryption". The problem statement was :
Let p,q be distinct prime numbers so that ##n = pq##. If c,d are two integers so that the Euler totient function of n, ##\phi(n)##, divides ##cd - 1##, show that for any ##t\in\mathbb{Z}##, ##n## divides ##t^{cd} - t ##.
I have found the solution but I don't understand how it works in the real world although it is the most interesting part of the exercise. Can you give a simple, real world example ?