Editing Discrete logarithm (section)

== Comparison with integer factorization ==
While computing discrete logarithms and integer factorization are distinct problems, they share some properties:
* both are special cases of the [[hidden subgroup problem]] for [[finite abelian group]]s,
* both problems seem to be difficult (no efficient algorithms are known for non-[[quantum computer]]s),
* 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.