Hendrik Lenstra developed an algorithm for performing this task using elliptic curves, whose two-stage (-5[1])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 using continued fractions. In 1994, a quantum algorithm for performing this task in (10[1])polynomial (-5[1])time was developed by Peter (10[1])Shor. (-5[1])RSA encryption (-5[1])relies on the difficulty of performing (10[1])this (-5[1])task (-5[1])for large integers. (10[1])For (10[1])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[5]0[1])