Introduction - If you have any usage issues, please Google them yourself
one, the basic tenets of RSA expressly group M and cipher block C, encryption and decryption process is as follows : C = POW (M, e) mod n = M POW (C, d) mod n = POW (POW (M, e), d) mod n = POW (M, e* d), which is an exponential function POW, mod is the pursuit of the remaining functions. Transceivers which both known n, send e Fang known, the only known recipient d, therefore the public key encryption algorithm for public key e KU = (n), private key for KR = (d, n). The algorithm could be used to be a public key encryption, must meet the following conditions : 1. E can be found, and d n, making all the right M
Packet : 11912924vc_rsa.rar filelist
VC_RSA\CCommon.cpp
VC_RSA\CCommon.h
VC_RSA\CDSA.cpp
VC_RSA\CDSA.h
VC_RSA\CRSA.cpp
VC_RSA\CRSA.h
VC_RSA\Debug
VC_RSA\folder.htt
VC_RSA\ReadMe.txt
VC_RSA\res
VC_RSA\resource.h
VC_RSA\RSA.APS
VC_RSA\RSA.clw
VC_RSA\RSA.cpp
VC_RSA\RSA.dsp
VC_RSA\RSA.dsw
VC_RSA\RSA.h
VC_RSA\RSA.ncb
VC_RSA\RSA.opt
VC_RSA\RSA.plg
VC_RSA\RSA.rc
VC_RSA\RSADlg.cpp
VC_RSA\RSADlg.h
VC_RSA\StdAfx.cpp
VC_RSA\StdAfx.h
VC_RSA