mathworld.wolfram.com/DiscreteLogarithm.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

7

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/DiscreteLogarithm.html

Discrete Logarithm -- from Wolfram MathWorld

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient function, exactly one number mu such that a=g^mu (mod n). The number mu is then called the discrete logarithm of a with respect to the base g modulo n and is denoted mu=ind_ga (mod n). The term "discrete logarithm" is most commonly used in cryptography, although the term "generalized multiplicative...



Bing

Discrete Logarithm -- from Wolfram MathWorld

https://mathworld.wolfram.com/DiscreteLogarithm.html

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient function, exactly one number mu such that a=g^mu (mod n). The number mu is then called the discrete logarithm of a with respect to the base g modulo n and is denoted mu=ind_ga (mod n). The term "discrete logarithm" is most commonly used in cryptography, although the term "generalized multiplicative...



DuckDuckGo

https://mathworld.wolfram.com/DiscreteLogarithm.html

Discrete Logarithm -- from Wolfram MathWorld

If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient function, exactly one number mu such that a=g^mu (mod n). The number mu is then called the discrete logarithm of a with respect to the base g modulo n and is denoted mu=ind_ga (mod n). The term "discrete logarithm" is most commonly used in cryptography, although the term "generalized multiplicative...

  • General Meta Tags

    25
    • title
      Discrete Logarithm -- from Wolfram MathWorld
    • DC.Title
      Discrete Logarithm
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient function, exactly one number mu such that a=g^mu (mod n). The number mu is then called the discrete logarithm of a with respect to the base g modulo n and is denoted mu=ind_ga (mod n). The term "discrete logarithm" is most commonly used in cryptography, although the term "generalized multiplicative...
    • description
      If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient function, exactly one number mu such that a=g^mu (mod n). The number mu is then called the discrete logarithm of a with respect to the base g modulo n and is denoted mu=ind_ga (mod n). The term "discrete logarithm" is most commonly used in cryptography, although the term "generalized multiplicative...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_DiscreteLogarithm.png
    • og:url
      https://mathworld.wolfram.com/DiscreteLogarithm.html
    • og:type
      website
    • og:title
      Discrete Logarithm -- from Wolfram MathWorld
    • og:description
      If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient function, exactly one number mu such that a=g^mu (mod n). The number mu is then called the discrete logarithm of a with respect to the base g modulo n and is denoted mu=ind_ga (mod n). The term "discrete logarithm" is most commonly used in cryptography, although the term "generalized multiplicative...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Discrete Logarithm -- from Wolfram MathWorld
    • twitter:description
      If a is an arbitrary integer relatively prime to n and g is a primitive root of n, then there exists among the numbers 0, 1, 2, ..., phi(n)-1, where phi(n) is the totient function, exactly one number mu such that a=g^mu (mod n). The number mu is then called the discrete logarithm of a with respect to the base g modulo n and is denoted mu=ind_ga (mod n). The term "discrete logarithm" is most commonly used in cryptography, although the term "generalized multiplicative...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_DiscreteLogarithm.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/DiscreteLogarithm.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

48