U E D R , A S I H C RSS

데블스캠프2011/다섯째날/Cryptography

p != q p q .
n <- p*q
φ(n) <- (p-1)*(q-1)
1 < e < φ(n)이면서 φ(n)과 서로소인 e를 선택한다.
d <- e1 mod φ(n)

(e, n) 공개, d

C : , P :
C = Pe mod n

C : , P :
P = Cd mod n

Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:29:11
Processing time 0.0077 sec