Tossup

Hendrik Lenstra developed an algorithm for performing this task using elliptic curves, 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 using continued fractions. In 1994, a quantum algorithm for performing this task in polynomial time was developed by Peter Shor. (10[1])RSA encryption relies (-5[1])on the difficulty of performing (10[2])this task for large (-5[1])integers. (10[1])For an integer n, a brute force method for performing this task checks all the integers from 1 (10[1])to the square root of n. For 10 points, name this task that decomposes an integer into a product (10[1])of smaller integers. ■END■ (10[2]0[2])

Back to tossups

Buzzes

Summary