[xoralkindi]

Shor's algorithm, originally designed for integer factorization, can also be adapted to solve the discrete logarithm problem in polynomial time on a quantum computer. There is also the less efficient Grover's algorithm can also be used for unstructured search problems on a quantum computer.

[notnullorvoid]

I was thinking more along the lines of solving in polynomial time on a conventional computer.