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 word comparison:

    “Away with the cant of “Measures, not men!”Mthe idle supposition that it is the harness and not the horses that draw the chariot along. No, Sir, if the comparison must be made, if the distinction must be taken, men are everything, measures comparatively nothing.”
    —George Canning (1770–1827)