Round 6: Tossup 14

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 (-5[1])time was developed by Peter Shor. (-5[1])RSA encryption relies on the difficulty of performing this task for (10[1])large integers. (10[1])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])

Back to tossups

Buzzes

Summary