enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Discrete_logarithm

    For example, log 10 10000 = 4, and log 10 0.001 = −3. These are instances of the discrete logarithm problem. Other base-10 logarithms in the real numbers are not instances of the discrete logarithm problem, because they involve non-integer exponents. For example, the equation log 10 53 = 1.724276… means that 10 1.724276… = 53.

  3. Pollard's rho algorithm for logarithms - Wikipedia

    en.wikipedia.org/wiki/Pollard's_rho_algorithm_for...

    Pollard's rho algorithm for logarithms is an algorithm introduced by John Pollard in 1978 to solve the discrete logarithm problem, ... is one of the solutions of ...

  4. Logarithm - Wikipedia

    en.wikipedia.org/wiki/Logarithm

    For example, logarithms appear in the analysis of algorithms that solve a problem by dividing it into two similar smaller problems and patching their solutions. [56] The dimensions of self-similar geometric shapes, that is, shapes whose parts resemble the overall picture are also based on logarithms.

  5. List of logarithmic identities - Wikipedia

    en.wikipedia.org/wiki/List_of_logarithmic_identities

    Logarithms can be used to make calculations easier. For example, two numbers can be multiplied just by using a logarithm table and adding. These are often known as logarithmic properties, which are documented in the table below. [2] The first three operations below assume that x = b c and/or y = b d, so that log b (x) = c and log b (y) = d.

  6. 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.

  7. Baby-step giant-step - Wikipedia

    en.wikipedia.org/wiki/Baby-step_giant-step

    In group theory, a branch of mathematics, the baby-step giant-step is a meet-in-the-middle algorithm for computing the discrete logarithm or order of an element in a finite abelian group by Daniel Shanks. [1] The discrete log problem is of fundamental importance to the area of public key cryptography.

  8. AOL Mail

    mail.aol.com

    Get AOL Mail for FREE! Manage your email like never before with travel, photo & document views. Personalize your inbox with themes & tabs. You've Got Mail!

  9. Complex logarithm - Wikipedia

    en.wikipedia.org/wiki/Complex_logarithm

    A single branch of the complex logarithm. The hue of the color is used to show the argument of the complex logarithm. The brightness of the color is used to show the modulus of the complex logarithm. The real part of log(z) is the natural logarithm of | z |. Its graph is thus obtained by rotating the graph of ln(x) around the z-axis.