Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
RSA encryption: n = pq, with p and q primes
 

Summary: 0
RSA encryption:
n = pq, with p and q primes
e relatively prime to (n) = (p - 1) (q -
1)
d inverse of e in Z(n)
Keys:
Public key: KE = (n, e)
Private key: KD =(n,d)
Encryption:
Plaintext M in Zn
C = Me
mod n
Decryption:
M = Cd
mod n = Med
mod n
Theorem 10.3: gcd(a,b) is the smallest
positive integer d such that d= ia+jb
(for integers i,j)

  

Source: Allan, Vicki H. - Department of Computer Science, Utah State University

 

Collections: Computer Technologies and Information Sciences