Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences (Q5402971): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 20:24, 5 March 2024

scientific article; zbMATH DE number 6273697
Language Label Description Also known as
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
    0 references
    0 references
    0 references
    0 references
    0 references
    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

    Identifiers