Universal hash functions \& hard core bits

DOI10.1007/3-540-49264-X_29MaRDI QIDQ2757258zbMATH OpenFDO

Authors Mats Näslund

Publication date 25 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49264-X_29

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1839461
• Advances in Cryptology – CRYPTO 2004
• Universal hashing and authentication codes
• Variationally universal hashing
• On the design of provably-secure cryptographic hash functions

Cited in

(6)

• Practical construction and analysis of pseudo-randomness primitives
• New Universal Hash Functions
• All bits in ax + b p are hard
• scientific article; zbMATH DE number 1839461 (Why is no real title available?)
• On linear-size pseudorandom generators and hardcore functions
• A caution on universal classes of hash functions

This page was built for publication: Universal hash functions \& hard core bits

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