Hendrik Lenstra developed an algorithm for performing this task using elliptic curves, (10[1])whose two-stage variant is analogous to one named after Pollard. Dixon’s method for performing this task forms the basis of an algorithm for performing this task (10[1])using continued fractions. In 1994, a quantum algorithm for performing (-5[1])this task in polynomial time (10[1])was developed by Peter Shor. RSA encryption (10[1])relies on (10[1])the difficulty of performing (10[1])this task for (10[1])large integers. For an integer n, a brute force method (10[1])for performing this task checks all the integers from 1 to the square root of n. For 10 points, name this task that decomposes an integer into a product of smaller integers. ■END■ (10[1]0[2])