The quadratic sieve factoring algorithm
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:integer_factorization_algorithm
|
| gptkbp:category |
cryptography
number theory |
| gptkbp:complexity |
sub-exponential
|
| gptkbp:fasterThan |
gptkb:general_number_field_sieve
continued fraction factorization method |
| gptkbp:input |
composite integer N
|
| gptkbp:introducedIn |
1981
|
| gptkbp:inventedBy |
gptkb:Carl_Pomerance
|
| gptkbp:notableFor |
GMP-ECM
Msieve YAFU |
| gptkbp:output |
nontrivial factors of N
|
| gptkbp:relatedTo |
gptkb:Dixon's_factorization_method
gptkb:general_number_field_sieve multiple polynomial quadratic sieve |
| gptkbp:usedFor |
factoring large integers
|
| gptkbp:uses |
linear algebra
modular arithmetic smooth numbers |
| gptkbp:bfsParent |
gptkb:Carl_Pomerance
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
The quadratic sieve factoring algorithm
|