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