Description: This is a very easy and simple and widely used algorithm, which is based on some of Gary Miller as the law, there is the development of Michael Rabin. In fact, it is recommended in the NIST' s DSS recommended a simplified version of the algorithm. First of all, choose a random number generation test of p, calculated b, b is divisible by 2, the number of p-1. Calculation of m, making n = 1+ (2 ^ b) m.
- [TestRsa] - Rsa personal series of source code, calc
File list (Check if you may need any files):
RSAUpper
........\Debug
........\.....\RSAUpper.bsc
........\.....\RSAUpper.exe
........\.....\RSAUpper.ilk
........\.....\RSAUpper.obj
........\.....\RSAUpper.pch
........\.....\RSAUpper.pdb
........\.....\RSAUpper.sbr
........\.....\StdAfx.obj
........\.....\StdAfx.sbr
........\.....\vc60.idb
........\.....\vc60.pdb
........\ReadMe.txt
........\ReadMe.txt.bak
........\RSAUpper.cpp
........\RSAUpper.dsp
........\RSAUpper.dsw
........\RSAUpper.ncb
........\RSAUpper.opt
........\RSAUpper.plg
........\StdAfx.cpp
........\StdAfx.h
Download