Description: P is a prime number based, a is the primitive root p, that is, a1, a2, a3, ..., ap-1 in the mod p under 1 to p-1 for all values, so for any b belongs to (1, ..., p-1), there are only i belong to (1, ..., p-1) makes ai mod p equivalent to p. Said i was under the modulus p to a for b at the end of the discrete logarithm.
To Search:
- [cryptopp552] - Encryption algorithm RSA, DSA, etc., usi
File list (Check if you may need any files):
lisanduishu
...........\Debug
...........\.....\lisanduishu.exe
...........\.....\lisanduishu.ilk
...........\.....\lisanduishu.obj
...........\.....\lisanduishu.pch
...........\.....\lisanduishu.pdb
...........\.....\vc60.idb
...........\.....\vc60.pdb
...........\lisanduishu.cpp
...........\lisanduishu.dsp
...........\lisanduishu.dsw
...........\lisanduishu.ncb
...........\lisanduishu.opt
...........\lisanduishu.plg
lisanduishu.cpp
Download