Let G be a finite cyclic group with n elements. We assume that the group is written multiplicatively. Let b be a generator of G. Then every element x of G can be written in the form x = b^{k} for some integer k; furthermore any two such integers representing x will be congruent modulo n. We can thus define a function
The familiar base change formula for ordinary logarithms remains valid: if c is another generator of G, then we have
For some groups, computing discrete logarithms is believed to be difficult, while the inverse problem of discrete exponentiation is not; this asymmetry is exploited in some applications in cryptography. Popular choices for G in cryptography are the cyclic groups (Z_{p})^{×} (consisting of the number {1,...,p1} under multiplication modulo the prime p); see ElGamal discrete log cryptosystem, DiffieHellman key exchange and the Digital Signature Algorithm.
The PohligHellman algorithm[?] can be used to compute discrete logarithms in these groups if p1 is a product of small primes, so this should be avoided in those applications. The index calculus[?] is another method to compute discrete logarithms in these groups, as is the birthday attack.
Newer cryptography applications use discrete logarithms in cyclic subgroups of elliptic curves over finite fields. See Elliptic curve cryptography.
Search Encyclopedia

Featured Article
