Universal Hash Functions & Hard Core Bits

@inproceedings{Aslund1995UniversalHF,
  title={Universal Hash Functions & Hard Core Bits},
  author={Nn Aslund},
  year={1995}
}
In this paper we consider the bit-security of two types of universal hash functions: linear functions on GFF2 n ] and linear functions on the integers modulo a prime. We show individual security for all bits in the rst case and for the O(log n) least signiicant 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… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Pseudo Random Number Generators from any One Way Function

J Astad, R Impagliazzo, L A Levin, M Luby
Pseudo Random Number Generators from any One Way Function • 1990

A Hard Core Predicate for any One Way Function

O Goldreich & L A Levin
STOC • 1989

Two Issues in Public Key Cryptography. An ACM distinguished Dissertation

B Chor
Two Issues in Public Key Cryptography. An ACM distinguished Dissertation • 1985

Vazirani: EEcient and Secure Pseudo-Random Number Generation

U V Vazirani
FOCS • 1984

Theory and application of trapdoor functions

23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) • 1982

Wegman: Universal Classes of Hash Functions

J L Carter
JCSS • 1979

This article was processed using the L a T E X macro package with LLNCS style

This article was processed using the L a T E X macro package with LLNCS style

Similar Papers

Loading similar papers…