MMH* with arbitrary modulus is always almost-universal (Q269733): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Restricted linear congruences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes / 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 |
Latest revision as of 17:13, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | MMH* with arbitrary modulus is always almost-universal |
scientific article |
Statements
MMH* with arbitrary modulus is always almost-universal (English)
0 references
6 April 2016
0 references
universal hashing
0 references
MMH*
0 references
GMMH*
0 references
linear congruence
0 references
cryptography
0 references
0 references