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)
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.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| rsa\BigIntegeer.cpp | 31362 | 2018-03-12
|
| rsa\BigInteger.cpp | 31328 | 2018-03-12
|
| rsa\BigInteger.h | 5348 | 2018-03-12
|
| rsa\Debug\BigIntegeer.obj | 280658 | 2018-03-12
|
| rsa\Debug\main.obj | 109454 | 2018-03-12
|
| rsa\Debug\MdRSACrypto.obj | 48256 | 2018-03-12
|
| rsa\Debug\rsa.exe | 639013 | 2018-03-12
|
| rsa\Debug\rsa.ilk | 853480 | 2018-03-12
|
| rsa\Debug\rsa.pch | 2685736 | 2018-03-12
|
| rsa\Debug\rsa.pdb | 1188864 | 2018-03-12
|
| rsa\Debug\vc60.idb | 91136 | 2018-03-12
|
| rsa\Debug\vc60.pdb | 110592 | 2018-03-12
|
| rsa\main.cpp | 940 | 2018-03-12
|
| rsa\MdRSACrypto.cpp | 3222 | 2018-03-12
|
| rsa\MdRSACrypto.h | 543 | 2018-03-12
|
| rsa\rsa.dsp | 4516 | 2018-03-12
|
| rsa\rsa.dsw | 529 | 2018-03-12
|
| rsa\rsa.ncb | 50176 | 2018-03-12
|
| rsa\rsa.opt | 49664 | 2018-03-12
|
| rsa\rsa.plg | 240 | 2018-03-12
|
| rsa\Debug | 0 | 2018-03-12
|
| rsa | 0 | 2018-03-12 |
Download