Abstract
In this paper new families of strongly universal hash functions, or equivalently, authentication codes, are proposed. Their parameters are derived from bounds on exponential sums over finite fields and Galois rings. This is the first time hash families based upon such exponential sums have been considered. Their performance improves the previously best known constructions and they can be made general in their choice of parameters. Furthermore, the constructions are suitable both for hardware and software implementations. The latter is an aspect that is significant and has been considered in several recent papers.KeywordsUniversal hash functionsauthentication codesexponential sumsGalois rings
Sign-in/Register to access full text options 
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.
