New constructions of universal hash functions based on function sums

In this paper, we propose a generalization of the SQUARE hash function family to the function sum hash, which is based on functions with low maximal differential over arbitrary Abelian groups. These new variants allow the designer to construct SQUARE-like hash functions on different platforms for ef...

Full description

Bibliographic Details
Main Authors: Khoo, , K, Heng, , SH
Format: Article
Published: 2006
Subjects:
Online Access:http://shdl.mmu.edu.my/2023/
_version_ 1848789942496395264
author Khoo, , K
Heng, , SH
author_facet Khoo, , K
Heng, , SH
author_sort Khoo, , K
building MMU Institutional Repository
collection Online Access
description In this paper, we propose a generalization of the SQUARE hash function family to the function sum hash, which is based on functions with low maximal differential over arbitrary Abelian groups. These new variants allow the designer to construct SQUARE-like hash functions on different platforms for efficient and secure message authentication. A variant using functions with low algebraic degree over a finite field is also proposed which enables the user to use a shorter key. For more versatility, we also propose a trade-off between the hash key length and security bound. Finally, we show that we can use an SPN structure in the function sum hash to construct a provably secure MAC with performance which is several times faster than the traditional CBC-MAC. Moreover, there are implementation advantages like parallelizability to increase the speed further and re-use of cipher components which help save on implementation resources.
first_indexed 2025-11-14T18:04:44Z
format Article
id mmu-2023
institution Multimedia University
institution_category Local University
last_indexed 2025-11-14T18:04:44Z
publishDate 2006
recordtype eprints
repository_type Digital Repository
spelling mmu-20232011-08-10T07:02:53Z http://shdl.mmu.edu.my/2023/ New constructions of universal hash functions based on function sums Khoo, , K Heng, , SH QA75.5-76.95 Electronic computers. Computer science In this paper, we propose a generalization of the SQUARE hash function family to the function sum hash, which is based on functions with low maximal differential over arbitrary Abelian groups. These new variants allow the designer to construct SQUARE-like hash functions on different platforms for efficient and secure message authentication. A variant using functions with low algebraic degree over a finite field is also proposed which enables the user to use a shorter key. For more versatility, we also propose a trade-off between the hash key length and security bound. Finally, we show that we can use an SPN structure in the function sum hash to construct a provably secure MAC with performance which is several times faster than the traditional CBC-MAC. Moreover, there are implementation advantages like parallelizability to increase the speed further and re-use of cipher components which help save on implementation resources. 2006 Article NonPeerReviewed Khoo, , K and Heng, , SH (2006) New constructions of universal hash functions based on function sums. COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2006, PT 3, 3982. pp. 416-425.
spellingShingle QA75.5-76.95 Electronic computers. Computer science
Khoo, , K
Heng, , SH
New constructions of universal hash functions based on function sums
title New constructions of universal hash functions based on function sums
title_full New constructions of universal hash functions based on function sums
title_fullStr New constructions of universal hash functions based on function sums
title_full_unstemmed New constructions of universal hash functions based on function sums
title_short New constructions of universal hash functions based on function sums
title_sort new constructions of universal hash functions based on function sums
topic QA75.5-76.95 Electronic computers. Computer science
url http://shdl.mmu.edu.my/2023/