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.

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

• 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．