RSA cipher

ed≡1 mod φ(n), n=pq,

where φ(・) is Euler's φ function, 

p,q in Prime Numbers.

e and d are the keys to respectively encode plain texts and decode them.