Quadratic Sieve (QS) Algorithm Quiz

To collect information on prime numbers

To identify special properties of integers

To solve complex matrices

To set up a congruence of squares modulo n (correct)

Euler

Gauss

Carl Pomerance (correct)

Schroeppel

It relies on special integer properties for factorization

It is limited to integers under 50 decimal digits

It is faster than the general number field sieve

It is considerably simpler than the number field sieve (correct)

<p>The size of the integer to be factorized</p> Signup and view all the answers

<p>Two phases</p> Signup and view all the answers