Abstract
In this paper we consider the bit-security of two types of universal hash functions: linear functions on GF[2n] and linear functions on the integers modulo a prime. We show individual security for all bits in the first case and for the O(log n) least significant bits in the second case. Both types of functions are shown to have O(log n) simultaneous secure bits. For the second type of functions, primes of length Ω(n) are needed.
Together with the Goldreich-Levin theorem, this shows that all the com- mon types of universal hash functions provide so called hard-core bits.
Chapter PDF
References
W. Alexi, B. Chor, O. Goldreich & C. P. Schnorr: RSA and Rabin Functions: Certain Parts Are as Hard As the Whole. SIAM J. on Computing vol 17, no 2 1988, pp. 194–209.
J. L. Carter & M. N. Wegman: Universal Classes of Hash Functions. JCSS 18 1979, pp. 265–278.
B. Chor: Two Issues in Public Key Cryptography. An ACM distinguished Dissertation. MIT Press 1985.
O. Goldreich & L. A. Levin: A Hard Core Predicate for any One Way Function. STOC 1989, pp. 25–32.
J. Håstad, R. Impagliazzo, L. A. Levin & M. Luby: Pseudo Random Number Generators from any One Way Function. Manuscript 1993. Earlier versions appeared in STOC 1989, 1990.
U. V. Vazirani & V. V. Vazirani: Efficient and Secure Pseudo-Random Number Generation. FOCS 1984, pp. 458–463.
A. C. Yao: Theory and Applications of Trapdoor Functions. FOCS 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Spnnger-Verlag Berlin Heidelberg
About this paper
Cite this paper
Näslund, M. (1995). Universal Hash Functions & Hard Core Bits. In: Guillou, L.C., Quisquater, JJ. (eds) Advances in Cryptology — EUROCRYPT ’95. EUROCRYPT 1995. Lecture Notes in Computer Science, vol 921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49264-X_29
Download citation
DOI: https://doi.org/10.1007/3-540-49264-X_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59409-3
Online ISBN: 978-3-540-49264-1
eBook Packages: Springer Book Archive