An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial (Q5346327)

From MaRDI portal





scientific article; zbMATH DE number 6727531
Language Label Description Also known as
English
An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial
scientific article; zbMATH DE number 6727531

    Statements

    An Upper Bound on the Complexity of Multiplication of Polynomials Modulo a Power of an Irreducible Polynomial (English)
    0 references
    0 references
    0 references
    8 June 2017
    0 references

    Identifiers

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