Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (Q1737153)
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: Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms |
scientific article; zbMATH DE number 7042731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms |
scientific article; zbMATH DE number 7042731 |
Statements
Use of SIMD-based data parallelism to speed up sieving in integer-factoring algorithms (English)
0 references
27 March 2019
0 references
integer factorization
0 references
multiple-polynomial quadratic sieve method
0 references
number-field sieve method
0 references
lattice sieve method
0 references
single instruction multiple data
0 references
0.938399851322174
0 references
0.7577198147773743
0 references
