Hendrik Lenstra developed an algorithm for performing this task using elliptic curves, whose two-stage variant is analogous to one (-5[1])named after Pollard. Dixon’s method for performing this task forms the basis of an algorithm for performing this task using continued fractions. In 1994, a quantum algorithm for performing this task (10[1])in polynomial time was developed by Peter Shor. (10[1])RSA encryption relies on the (-5[1])difficulty of performing this task for large integers. For an integer n, a brute force method 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[2])