Description: Discrete number of shanks on demand algorithm, the following: calculation of Zp calculated to achieve the discrete logarithm Shanks algorithm, the basic requirements are as follows: 1) p is a small prime number (less than 32 bit), a is a primitive element. Process input (p, a, b), output logab (mod p) (can use log3525 (mod 809) so as a test) 2) The fast mode index algorithm to solve the power (such as the am), using extended Euclidean Reed inverse algorithm (such as ai (mod p)) 3) use a good sorting algorithm on the L1, L2 sort 4) using probabilistic algorithms (such as the Miller Rabin algorithm) automatically primes p, using primitive element automatically generate the necessary and sufficient conditions a
File list (Check if you may need any files):
shanks\shanks\Debug\BuildLog.htm
......\......\.....\mt.dep
......\......\.....\shanks.exe.embed.manifest
......\......\.....\shanks.exe.embed.manifest.res
......\......\.....\shanks.exe.intermediate.manifest
......\......\.....\shanks.obj
......\......\.....\shanks.pch
......\......\.....\shanks.res
......\......\.....\shanksDlg.obj
......\......\.....\stdafx.obj
......\......\.....\vc80.idb
......\......\.....\vc80.pdb
......\......\ReadMe.txt
......\......\res\shanks.ico
......\......\...\shanks.rc2
......\......\resource.h
......\......\shanks.aps
......\......\shanks.cpp
......\......\shanks.h
......\......\shanks.rc
......\......\shanks.vcproj
......\......\shanks.vcproj.LENOVO-BD620171.Owner.user
......\......\shanksDlg.cpp
......\......\shanksDlg.h
......\......\stdafx.cpp
......\......\stdafx.h
......\shanks.ncb
......\shanks.sln
......\shanks.suo
......\......\Debug
......\......\res
......\shanks
shanks
Download