On linear hashing of binary sets

MaRDI QIDQ1280345zbMATH OpenFDO

Authors A. A. Bolotov, Alexander E. Andreev

Publication date 15 March 1999

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

linear hashing operator

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Review text

The main result of the paper is as follows. For any \(k\) let the inequality \[ 2^{k+1} - k - 2> \tfrac 12 m(m-1) \] be satisfied, where \(m=O(n^p)\) has polynomial growth. Then there exists a linear hashing operator \(\mathcal H\) with the scheme realization complexity \[ l(\mathcal H)\lesssim 2p(n-2p\log n)\log n, \] which can be efficiently constructed.

Recommendations

• scientific article; zbMATH DE number 1559562
• Linear hash functions
• Optimal hashing
• Linear hashing is awesome

Cited in

(3)

• Linear hash functions
• Equality testing for complex objects based on hashing
• scientific article; zbMATH DE number 1559562 (Why is no real title available?)

This page was built for publication: On linear hashing of binary sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280345)