Blockcipher Based Hashing Revisited (2009)

View PDF

Download Links

by Martijn Stam
Venue:Fast Software Encryption – FSE ’09
Citations:4 - 1 self

Active Bibliography

1 Security Analysis and Comparison of the SHA-3 Finalists – Elena Andreeva, Bart Mennink, Bart Preneel, Marjan ˇ Skrobot
21 Constructing cryptographic hash functions from fixed-key blockciphers. Full version of this paper – Phillip Rogaway, John Steinberger - 2008
Cryptographic Hash Functions: Recent Design Trends and Security Notions ∗ – Saif Al-kuwari, James H. Davenport, Russell J. Bradford
1 Efficient Hashing using the AES Instruction Set – Onur Özen, Martijn Stam
17 Building a collision-resistant compression function from non-compressing primitives – Thomas Shrimpton, Martijn Stam - 2008
15 M.: Indifferentiable security analysis of popular hash functions with prefix-free padding – Donghoon Chang, Sangjin Lee, Mridul N, Moti Yung - 2006
A unified indifferentiability proof for . . . – Anne Canteaut, Thomas Fuhr, et al.
On the Design of Secure and Fast Double Block Length Hash Functions – Zheng Gong, Xuejia Lai, Kefei Chen
ABSTRACT DESIGN AND ANALYSIS OF HASH FUNCTIONS – unknown authors - 2009