Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences (Q5402971)
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: Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences |
scientific article; zbMATH DE number 6273697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences |
scientific article; zbMATH DE number 6273697 |
Statements
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences (English)
0 references
25 March 2014
0 references
Coppersmith's algorithm
0 references
small roots of polynomial equations
0 references
LLL
0 references
complexity
0 references
speedup
0 references
RSA
0 references
0.8357046842575073
0 references
0.8163802623748779
0 references
0.8144031763076782
0 references
0.8018727898597717
0 references
