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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
