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:
“Intolerance respecting other peoples religion is toleration itself in comparison with intolerance respecting other peoples art.”
—Wallace Stevens (18791955)
“But the best read naturalist who lends an entire and devout attention to truth, will see that there remains much to learn of his relation to the world, and that it is not to be learned by any addition or subtraction or other comparison of known quantities, but is arrived at by untaught sallies of the spirit, by a continual self-recovery, and by entire humility.”
—Ralph Waldo Emerson (18031882)