Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11751595_45 | ICCSA (3) |
Keywords | Field | DocType |
square-like hash function,universal hash function,square hash function family,low algebraic degree,secure message authentication,implementation advantage,provably secure mac,low maximal differential,hash key length,new construction,implementation resource,function sum hash,abelian group,hash function,finite field,message authentication code,provable security | SHA-2,Double hashing,Computer science,Collision resistance,Cryptographic hash function,Theoretical computer science,SWIFFT,Hash function,Hash chain,MDC-2 | Conference |
Volume | ISSN | ISBN |
3982 | 0302-9743 | 3-540-34075-0 |
Citations | PageRank | References |
1 | 0.35 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Khoongming Khoo | 1 | 250 | 23.29 |
| Swee-Huay Heng | 2 | 384 | 47.50 |