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

VC_RSA
......\CCommon.cpp
......\CCommon.h
......\CDSA.cpp
......\CDSA.h
......\CRSA.cpp
......\CRSA.h
......\Debug
......\ReadMe.txt
......\res
......\resource.h
......\RSA.APS
......\RSA.clw
......\RSA.cpp
......\RSA.dsp
......\RSA.dsw
......\RSA.h
......\RSA.ncb
......\RSA.opt
......\RSA.plg
......\RSA.rc
......\RSADlg.cpp
......\RSADlg.h
......\StdAfx.cpp
......\StdAfx.h

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．