First Page | Document Content | |
---|---|---|
Date: 2010-09-16 10:24:31Computational hardness assumptions Group theory Cryptographic protocols Modular arithmetic Discrete logarithm Cyclic group Diffie–Hellman problem Prime number Order Abstract algebra Algebra Finite fields | Counting in number theory Finite cyclic groupsAdd to Reading ListSource URL: www.math.dartmouth.eduDownload Document from Source WebsiteFile Size: 867,14 KBShare Document on Facebook |