Title
Universal hash functions over GF(2n)
Abstract
This paper proposes variants of MMH and SQUARE universal hash functions families over the finite field (Galois field) GF (2n). These new variants are suited for implementation on platforms where there are no built-in specialized algorithms for modular multiplication. There are especially suited on platforms, which have already an embedded GF (2n)-based cryptosystem. These variants can be utilized to provide efficient and secure message authentication.
Year
DOI
Venue
2004
10.1109/ISIT.2004.1365242
international symposium on information theory
Keywords
DocType
ISBN
cryptography,universal hash function,secure message authentication,embedded finite galois field,modular multiplication,gf,galois fields,message authentication,square hash function,galois field,finite field,hash function
Conference
0-7803-8280-3
Citations 
PageRank 
References 
1
0.36
3
Authors
2
Name
Order
Citations
PageRank
Khoongming Khoo125023.29
Swee-Huay Heng238447.50