A trade-off between collision probability and key size in universal hashing using polynomials (Q2430412)

From MaRDI portal
Revision as of 11:37, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A trade-off between collision probability and key size in universal hashing using polynomials
scientific article

    Statements

    A trade-off between collision probability and key size in universal hashing using polynomials (English)
    0 references
    0 references
    6 April 2011
    0 references
    universal hash function
    0 references
    polynomial-based hashing
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references