Subquadratic-time factoring of polynomials over finite fields (Q4396457)

From MaRDI portal
Revision as of 08:26, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1165749
Language Label Description Also known as
English
Subquadratic-time factoring of polynomials over finite fields
scientific article; zbMATH DE number 1165749

    Statements

    Subquadratic-time factoring of polynomials over finite fields (English)
    0 references
    0 references
    0 references
    14 June 1998
    0 references
    factoring
    0 references
    univariate polynomials
    0 references
    finite fields
    0 references
    subquadratic complexity
    0 references
    baby step/giant step
    0 references
    probabilistic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references