The problem of inverting exponentiation in finite groups
In mathematics, for given real numbers a and b, the logarithm logba is a number x such that bx = a. Analogously, in any group G, powers bk can be defined for all integers k, and the discrete logarithm logba is an integer k such that bk = a. In number theory, the more commonly used term is index: we can write x = indra (mod m) (read "the index of a to the base r modulo m") for rx ≡ a (mod m) if r is a primitive root of m and gcd(a,m) = 1.
Discrete logarithms are quickly computable in a few special cases, however, no efficient method is known for computing them in general. In cryptography, the computational complexity of the discrete logarithm problem and its application, was first proposed in the Diffie–Hellman problem. Several important algorithms in public-key cryptography, such as ElGamal, base their security on the hardness assumption that the discrete logarithm problem (DLP) over carefully chosen groups has no efficient solution.[1]
^Menezes, A. J.; van Oorschot, P. C.; Vanstone, S. A. "Chapter 8.4 ElGamal public-key encryption" (PDF). Handbook of Applied Cryptography. CRC Press.
and 18 Related for: Discrete logarithm information
logarithm logb a is a number x such that bx = a. Analogously, in any group G, powers bk can be defined for all integers k, and the discretelogarithm...
Discretelogarithm records are the best results achieved to date in solving the discretelogarithm problem, which is the problem of finding solutions x...
example, the complex logarithm is the multi-valued inverse of the complex exponential function. Similarly, the discretelogarithm is the multi-valued inverse...
of a certain problem in G {\displaystyle G} related to computing discretelogarithms. The algorithm can be described as first performing a Diffie–Hellman...
of the discrete logarithms of an + 1, called Zech's logarithms, for n = 0, ..., q − 2 (it is convenient to define the discretelogarithm of zero as being...
algorithm is a probabilistic algorithm for computing discretelogarithms. Dedicated to the discretelogarithm in ( Z / q Z ) ∗ {\displaystyle (\mathbb {Z} /q\mathbb...
mathematics which have discrete versions, such as discrete calculus, discrete Fourier transforms, discrete geometry, discretelogarithms, discrete differential...
problems are intractable, such as the integer factorization or the discretelogarithm problems, so there are deep connections with abstract mathematics...
ciphers are based on the difficulty of factoring integers or the discretelogarithm problem, both of which can be solved by Shor's algorithm. In particular...
for very large integers. On the other hand, computing the modular discretelogarithm – that is, finding the exponent e when given b, c, and m – is believed...
the first whose security is based on the intractability of certain discretelogarithm problems. It is efficient and generates short signatures. It was covered...
based on the mathematical concept of modular exponentiation and the discretelogarithm problem. DSA is a variant of the Schnorr and ElGamal signature schemes...
Field Sieve is one of the most efficient algorithms to solve the DiscreteLogarithm Problem (DLP) in a finite field. It has heuristic subexponential complexity...
then the problem of solving discretelogarithm modulo p is in P. Therefore, for cryptosystems based on discretelogarithm, such as DSA, it is required...
is computationally inexpensive, whereas the inverse operation, the discretelogarithm, is computationally expensive. More precisely, if g is a primitive...
computational Diffie–Hellman problem. Two variants of IES are specified: DiscreteLogarithm Integrated Encryption Scheme (DLIES) and Elliptic Curve Integrated...
Global Information