Question

I want to know about the explanation of RSA, here is the example

Select primes: p=17 & q=11
Compute n = pq =17×11=187
Compute ø(n)=(p–1)(q-1)=16×10=160
Select e : gcd(e,160)=1; choose e=7
Determine d: de=1 mod 160 and d < 160 Value is d=23 since 23×7=161= 10×160+1
Publish public key KU={7,187}
Keep secret private key KR={23,17,11}

Look at the prime numbers written above, how can i know from where those prime numbers are generated.

Answer 1

Those prime numbers can be generated randomly by the RSA algorithm. In this example they are very small, but in real life the would be very very large. The algorithm will also take some other precautions when generating the primes. For instance, p and q should not be close to one another.