Name
Abstract | ||
|---|---|---|
We present new techniques for deriving preimage resistance bounds for block cipher based double-block-length, double-call hash functions. We give improved bounds on the preimage security of the three "classical" double-block-length, double-call, block cipher-based compression functions, these being Abreast-DM, Tandem-DM and Hirose's scheme. For Hirose's scheme, we show that an adversary must make at least 22n−5 block cipher queries to achieve chance 0.5 of inverting a randomly chosen point in the range. For Abreast-DM and Tandem-DM we show that at least 22n−10 queries are necessary. These bounds improve upon the previous best bounds of Ω(2n) queries, and are optimal up to a constant factor since the compression functions in question have range of size 22n. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-25385-0_13 | ASIACRYPT |
Keywords | DocType | Volume |
constant factor,double-block-length compression function,double-call hash function,preimage resistance bound,block cipher,previous best bound,cipher-based compression function,preimage security,compression function,cipher query,new technique | Journal | 2011 |
Issue | ISSN | Citations |
null | 0302-9743 | 162 |
PageRank | References | Authors |
3.95 | 21 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Frederik Armknecht | 1 | 1000 | 68.65 |
| Ewan Fleischmann | 2 | 298 | 14.90 |
| Matthias Krause 0001 | 3 | 518 | 34.60 |
| Jooyoung Lee | 4 | 573 | 46.13 |
| Martijn Stam | 5 | 1659 | 67.36 |
| John Steinberger | 6 | 394 | 13.62 |