DocumentCode
2054660
Title
Universal hash functions over GF(2n)
Author
Khoo, Khoongming ; Heng, Swee-Huay
Author_Institution
DSO Nat. Lab., Singapore
fYear
2004
fDate
27 June-2 July 2004
Firstpage
205
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.
Keywords
Galois fields; cryptography; message authentication; GF; SQUARE hash function; embedded finite Galois field; modular multiplication; secure message authentication; universal hash function; Application software; Computer science; Drives; Elliptic curve cryptography; Galois fields; Laboratories; Message authentication; Security;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365242
Filename
1365242
Link To Document