New Universal Hash Functions
2012 (English)In: Lecture Notes in Computer Science, Vol. 7242 / [ed] Frederik Armknecht and Stefan Lucks, Springer Berlin Heidelberg , 2012, 99-108 p.Conference paper (Refereed)
Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of Almost Strongly Universal hash functions with much smaller description (or key) length than the Wegman-Carter construction. Unlike some other constructions, our new construction has a very short key length and a security parameter that is independent of the message length, which makes it suitable for authentication in practical applications such as Quantum Cryptography.
Place, publisher, year, edition, pages
Springer Berlin Heidelberg , 2012. 99-108 p.
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 7242
Other Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:liu:diva-84711DOI: 10.1007/978-3-642-34159-5_7ISBN: 978-3-642-34158-8 (print)ISBN: 978-3-642-34159-5 (online)OAI: oai:DiVA.org:liu-84711DiVA: diva2:561455
4th Western European Workshop on Research in Cryptology, WEWoRC 2011, Weimar, Germany, July 20-22, 2011