2010 Reports :  Cryptology ePrint Archive Forum
Discussion forum for Cryptology ePrint Archive reports posted in 2010. Please put the report number in the subject.  

Current Page: 1 of 1
Results 1 - 6 of 6
28-Dec-2010 15:58
wai2ha
It's interesting that 2010/430 and 2010/384 said there's a big trouble with narrow-pipe hash functions.
Forum: 2010 Reports
24-Dec-2010 17:00
wai2ha
Applications of surjection round try to thwart the conclusion( Of 2010/384 and 2010/430) on narrow-pipe hash functions.
Forum: 2010 Reports
13-Aug-2010 13:59
Orr
Danilo, Your are entitled to your opinion. But narrow pipe designs are more efficient, and their security is clearly defined (the discussion on the hash function mailing list can probably explain w
Forum: 2010 Reports
09-Aug-2010 05:38
gligoroski

Forum: 2010 Reports
05-Aug-2010 23:01
Vlastimil Klima
Orr, you mix theory and practice, hash function and compression functions together. We even underlined the difference between hash function calls and compression function calls in the paper.
Forum: 2010 Reports
05-Aug-2010 19:28
Orr
The authors of 2010/430 claim that finding collisions in a narrow-pipe takes 2^{n/2-k/2} calls for the _hash function_, which is lower than 2^n/2 expected by the birthday bound. However, the collid
Forum: 2010 Reports
Current Page: 1 of 1

Search Messages   Search Authors