Factoring with the quadratic sieve on large vector computers (Q1825224): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Walter M. Lioen / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Dik T. Winter / rank | |||
Normal rank |
Revision as of 15:08, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Factoring with the quadratic sieve on large vector computers |
scientific article |
Statements
Factoring with the quadratic sieve on large vector computers (English)
0 references
1989
0 references
Let N be a number to be factorized, and let a, b, c be chosen to that \(N=b^ 2-a^ 2c\). Let \(U(x)=a^ 2x+b\), \(V=a\), and \(W(x)=a^ 2x^ 2+2bc+c\); then \(U^ 2\equiv V^ 2W (mod N)\). For various a, b, c, and x, the W's that factorize over a given set of primes are collected until a set whose product is a square is obtained. The authors report results obtained by this method; the best is the factorization of a 93-digit number.
0 references
CYBER 205
0 references
NEX SX-2
0 references
quadratic sieve
0 references
vector computers
0 references
factorization
0 references