Factoring Integers with Large-Prime Variations of the Quadratic Sieve (Q4347264)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1045592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factoring Integers with Large-Prime Variations of the Quadratic Sieve |
scientific article; zbMATH DE number 1045592 |
Statements
Factoring Integers with Large-Prime Variations of the Quadratic Sieve (English)
0 references
17 February 1998
0 references
factorization
0 references
multiple polynomial quadratic sieve
0 references
vector supercomputer
0 references
cluster of workstations
0 references
0 references
0 references
0.8944482803344727
0 references
0.8916330337524414
0 references
0.8606535792350769
0 references
The authors present their work on the one and two large prime variants of the multiple polynomial quadratic sieve algorithm for factoring integers. Perhaps the most important contribution of this paper is its study of algorithm crossover points, running time predictions, and algorithm parameter choices. The introduction and description of the quadratic sieve factoring algorithm are also well done, and they present the data on over 80 factorizations of integers ranging from 66 to 88 decimal digits in size.
0 references
