Description: 1. problem description The RSA cryptosystem can be specifically described as: take two large prime numbers P and Q, make n=pq, N= (p-1) (Q-1), select integer D randomly, and satisfy GCD (D, N) =1. Public key: k1= (n, e)
Platform: |
Size: 1108992 |
Author: Appoint |
Hits: