enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Discrete logarithm - Wikipedia

    en.wikipedia.org/wiki/Discrete_logarithm

    Discrete logarithm. In mathematics, for given real numbers a and b, the logarithm log b 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 discrete logarithm log b a is an integer k such that bk = a. In number theory, the more commonly used term is index: we can write x = ind r a ...

  3. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    In mathematics, the logarithm to base b is the inverse function of exponentiation with base b. That means that the logarithm of a number x to the base b is the exponent to which b must be raised to produce x. For example, since 1000 = 10 3, the logarithm base of 1000 is 3, or log 10 (1000) = 3.

  4. Discrete logarithm records - Wikipedia

    en.wikipedia.org/wiki/Discrete_logarithm_records

    Discrete logarithm records are the best results achieved to date in solving the discrete logarithm problem, which is the problem of finding solutions x to the equation given elements g and h of a finite cyclic group G. The difficulty of this problem is the basis for the security of several cryptographic systems, including Diffie–Hellman key ...

  5. Index calculus algorithm - Wikipedia

    en.wikipedia.org/wiki/Index_calculus_algorithm

    In computational number theory, the index calculus algorithm is a probabilistic algorithm for computing discrete logarithms. Dedicated to the discrete logarithm in where is a prime, index calculus leads to a family of algorithms adapted to finite fields and to some families of elliptic curves. The algorithm collects relations among the discrete ...

  6. Pollard's kangaroo algorithm - Wikipedia

    en.wikipedia.org/wiki/Pollard's_kangaroo_algorithm

    Pollard's kangaroo algorithm. In computational number theory and computational algebra, Pollard's kangaroo algorithm (also Pollard's lambda algorithm, see Naming below) is an algorithm for solving the discrete logarithm problem. The algorithm was introduced in 1978 by the number theorist John M. Pollard, in the same paper as his better-known ...

  7. Shor's algorithm - Wikipedia

    en.wikipedia.org/wiki/Shor's_algorithm

    Shor proposed multiple similar algorithms for solving the factoring problem, the discrete logarithm problem, and the period-finding problem. "Shor's algorithm" usually refers to the factoring algorithm, but may refer to any of the three algorithms. The discrete logarithm algorithm and the factoring algorithm are instances of the period-finding ...

  8. Logarithmic distribution - Wikipedia

    en.wikipedia.org/wiki/Logarithmic_distribution

    In probability and statistics, the logarithmic distribution (also known as the logarithmic series distribution or the log-series distribution) is a discrete probability distribution derived from the Maclaurin series expansion. From this we obtain the identity. This leads directly to the probability mass function of a Log (p)-distributed random ...

  9. Data transformation (statistics) - Wikipedia

    en.wikipedia.org/wiki/Data_transformation...

    Data transformation (statistics) A scatterplot in which the areas of the sovereign states and dependent territories in the world are plotted on the vertical axis against their populations on the horizontal axis. The upper plot uses raw data. In the lower plot, both the area and population data have been transformed using the logarithm function.