The instances where quantum algorithms have exponential speedups over the best known classical algorithm have been mostly number theoretic in nature. As public-key cryptography is based on computationally hard problems in number theory, developing post-quantum cryptography depends on understanding which of these problems have efficient quantum algorithms. In this talk I will discuss some problems from number theory that have efficient quantum algorithms and also ones that are targets for potential quantum algorithms.