RSA Reloaded
摘要:
pick two large (n-bit) random prime p and q.public key is (N,e) where N=pq and e is a (2n-bit) number relatively prime to (p-1)(q-1).A common choice is e =3 because it permits fast encoding.secret key is d, the inverse of e modulo (p-1)(q-1), computed using the extended euclid algorithm.Instances:pu 阅读全文
posted @ 2012-02-18 20:25 grepp 阅读(143) 评论(0) 推荐(0) 编辑