Results 1 -
1 of
1
The Quadratic Sieve Factoring Algorithm
, 2001
"... Mathematicians have been attempting to find better and faster ways to factor composite numbers since the beginning of time. Initially this involved dividing a number by larger and larger primes until you had the factorization. This trial division was not improved upon until Fermat applied the ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Mathematicians have been attempting to find better and faster ways to factor composite numbers since the beginning of time. Initially this involved dividing a number by larger and larger primes until you had the factorization. This trial division was not improved upon until Fermat applied the
