Discrete Logarithm - Comparison With Integer Factorization

Comparison With Integer Factorization

While the problem of computing discrete logarithms and the problem of integer factorization are distinct problems they share some properties:

  • both problems are difficult (no efficient algorithms are known for non-quantum computers),
  • for both problems efficient algorithms on quantum computers are known,
  • algorithms from one problem are often adapted to the other, and
  • the difficulty of both problems has been used to construct various cryptographic systems.

Read more about this topic:  Discrete Logarithm

Famous quotes containing the words comparison with and/or comparison:

    “He was a superior man. He did not value his bodily life in comparison with ideal things. He did not recognize unjust human laws, but resisted them as he was bid. For once we are lifted out of the trivialness and dust of politics into the region of truth and manhood.”
    —Henry David Thoreau (1817–1862)

    “What is man in nature? A nothing in comparison with the infinite, an all in comparison with the nothing—a mean between nothing and everything.”
    —Blaise Pascal (1623–1662)