Introduction - If you have any usage issues, please Google them yourself
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)
Private key: k2= (P, Q, d)
Encryption algorithm: for the encrypted message M, its corresponding ciphertext is c=E (m) =me (MODN)
Decryption algorithm: D (c) =cd (MODN)
2. basic requirements
P, Q, D, e parameters are selected reasonably, the program requires friendly interface and high degree of automation.
4. realization hints
To implement a real RSA cryptosystem, the main consideration is to deal with large integers. P and Q are 1024 bits, and N takes 2048.