作者: Mridul Nandi , Ashwin Jha
DOI:
关键词:
摘要: At SAC 2006, Liskov proposed the zipper hash, a technique for constructing secure (indifferentiable from random oracles) hash functions based on weak (invertible) compression functions. Zipper is two pass scheme, which makes it unfit practical consideration. But, theoretical point of view seemed to be secure, as had resisted standard attacks long. Recently, Andreeva et al. gave forced-suffix herding attack and Chen Jin showed second preimage provided f1 strong invertible. In this paper, we analyse construction under oracle model well when underlying have some weakness. We show (second) preimage, an n-bit its relaxed variant with = f2, all require less than 2 n online computations. Hoch Shamir shown that concatenated offers only bits security both are bound tight even one