Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms (Q5202277)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms |
scientific article; zbMATH DE number 4193830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms |
scientific article; zbMATH DE number 4193830 |
Statements
Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms (English)
0 references
1991
0 references
factorization algorithm
0 references
quadratic sieve
0 references
Farey intervals
0 references
lattice points between two parabolas
0 references
complexity bound
0 references
0 references
0.8089264
0 references
0.8079043
0 references
0.80559325
0 references
0.80256367
0 references
