Name
Abstract | ||
|---|---|---|
In this paper, we introduce a new class of double-blocklength hash functions. In the ideal cipher model (for n-bit blocks), we prove that these hash functions, dubbed MJH, are provably collision resistant up to O(22n/3-log n) queries in the iteration. When based on n-bit key blockciphers, our construction provides better provable security than MDC-2, the only known construction of a rate-1/2 double-length hash function based on an n-bit key blockcipher with non-trivial provable security. Moreover, since key scheduling is performed only once per message block for MJH, our proposal significantly outperforms MDC-2 in efficiency. When based on a 2n-bit key blockcipher, we can use the extra n bits of key to increase the amount of payload accordingly. Thus we get a rate-1 hash function that is much faster than existing proposals, such as Tandem-DM, at the expense of (for the moment) reduced provable security. |
Year | DOI | Venue |
|---|---|---|
2014 | https://doi.org/10.1007/s10623-014-9936-6 | Lecture Notes in Computer Science |
Keywords | DocType | Volume |
Hash function,Blockcipher,Provable security,Collision resistance,94A60 | Journal | 76 |
Issue | ISSN | Citations |
2 | 0925-1022 | 17 |
PageRank | References | Authors |
0.60 | 40 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jooyoung Lee | 1 | 573 | 46.13 |
| Martijn Stam | 2 | 1659 | 67.36 |