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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MMH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Poly1305-AES / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-010-9408-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993825099 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Software Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes Which Detect Deception / rank
 
Normal rank
Property / cites work
 
Property / cites work: MMH: Software message authentication in the Gbit/second rates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of polynomials by rational preparation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket hashing and its application to fast message authentication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general mixing strategy for the ECB-Mix-ECB mode of operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Fast and Provably Secure Message Authentication Based on Universal Hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal hashing and authentication codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hash functions and their use in authentication and set equality / rank
 
Normal rank

Latest revision as of 23:27, 3 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    universal hash function
    0 references
    polynomial-based hashing
    0 references
    0 references
    0 references
    0 references