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:
“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)
“The difference between human vision and the image perceived by the faceted eye of an insect may be compared with the difference between a half-tone block made with the very finest screen and the corresponding picture as represented by the very coarse screening used in common newspaper pictorial reproduction. The same comparison holds good between the way Gogol saw things and the way average readers and average writers see things.”
—Vladimir Nabokov (1899–1977)