OurBigBook.comSite Source code

RSA cryptosystem

For

N = pq

, choose

e

coprime to

ϕ (N)

and a private exponent

d

with

e d \equiv 1 (mod ϕ (N))

. Encryption and decryption are

c \equiv m^{e} (mod N), m \equiv c^{d} (mod N) .

Table of contents 129 2
- Common-modulus RSA attack RSA cryptosystem 38
- RSA private exponent reveals the factorization RSA cryptosystem 64

 Ancestors (4)

 Incoming links (2)