Abstract. Given a large n-bits integer N < 2n, Shor’s algorithm finds with positive probability a factor of N after O(n2 log n log log n) quantum steps. We describe some of the mathematical aspects of Shor’s algorithm. We mainly follow a description due to M. Batty, S.L. Braunstein, A. J. Duncan and S. Rees. 1.