Tossup

Hendrik Lenstra developed an algorithm for performing this task using elliptic curves, (10[1])whose two-stage variant is analogous to one (10[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 in polynomial time was developed (-5[1])by Peter Shor. (-5[1])RSA encryption relies on the difficulty of performing this task (10[1])for large (10[1])integers. For an integer n, (-5[1])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. (10[1])■END■ (10[2])

Back to tossups

Buzzes

Summary