Filters








7 Hits in 2.9 sec

MJH: a faster alternative to MDC-2

Jooyoung Lee, Martijn Stam
2014 Designs, Codes and Cryptography  
Moreover, since key scheduling is performed only once per message block for MJH, our proposal significantly outperforms MDC-2 in efficiency.  ...  When based on n-bit key blockciphers, our construction, being of rate 1/2, provides better provable security than MDC-2, the only known construction of a rate-1/2 double-length hash function based on an  ...  This translates into a speedup of about 10% to 15% of MJH over MDC-2 (the extra key-schedule processing is not an issue here).  ... 
doi:10.1007/s10623-014-9936-6 fatcat:vohpltch3rfdxdrbjo55hudo4u

MJH: A Faster Alternative to MDC-2 [chapter]

Jooyoung Lee, Martijn Stam
2011 Lecture Notes in Computer Science  
Moreover, since key scheduling is performed only once per message block for MJH, our proposal significantly outperforms MDC-2 in efficiency.  ...  When based on n-bit key blockciphers, our construction, being of rate 1/2, provides better provable security than MDC-2, the only known construction of a rate-1/2 double-length hash function based on an  ...  This translates into a speedup of about 10% to 15% of MJH over MDC-2 (the extra key-schedule processing is not an issue here).  ... 
doi:10.1007/978-3-642-19074-2_15 fatcat:qeugm2y4mna7reqvt4vd3yroim

Efficient Hashing Using the AES Instruction Set [chapter]

Joppe W. Bos, Onur Özen, Martijn Stam
2011 Lecture Notes in Computer Science  
In this work, we provide a software benchmark for a large range of 256-bit blockcipher-based hash functions.  ...  We instantiate the underlying blockcipher with AES, which allows us to exploit the recent AES instruction set (AES-NI).  ...  We gratefully acknowledge Çagdaş Çalık, for granting us access to the Intel i5 with AES-NI to benchmark our programs and Thorsten Kleinjung for useful discussions on how to optimize the SSE polynomial  ... 
doi:10.1007/978-3-642-23951-9_33 fatcat:4z66rhbbyjabfjurfzjzgf3d5y

Open problems in hash function security

Elena Andreeva, Bart Mennink, Bart Preneel
2015 Designs, Codes and Cryptography  
A cryptographic hash function compresses arbitrarily long messages to digests of a short and fixed length.  ...  Most of existing hash functions are designed to evaluate a compression function with a finite domain in a mode of operation, and the compression function itself is often designed from block ciphers or  ...  87] MDC-2 [93] 2 2 n/2 2 n 1 [87] MJH [74] 2 2 n/2 2 n 1 [87] Jetchev et al  ... 
doi:10.1007/s10623-015-0096-0 fatcat:alir2p5gybgvrbup5jfvjf45te

Contributions to cryptanalysis: design and analysis of cryptographic hash functions

Przemysław Szczepan Sokołowski
2022
To demonstrate the efficiency of proposed distinguishers, we provide formal proof of a lower bound for finding a differential pair that follows a truncated differential in the case of a random permutation  ...  It fullfils a collection of security requirements guaranteeing that a hash function does not introduce any weakness into the system to which it is applied.  ...  His guidance and care have been priceless to me and I am forever indebted to him. I would like to thank Prof.  ... 
doi:10.25949/19433756.v1 fatcat:wtecbhybqvaudleejsep2wfun4

Design and Analysis of Multi-Block-Length Hash Functions

Onur Özen
2012
key, n-bit block blockcipher) are MDC-2 [37] and MJH [105] .  ...  Cette construction est similaire à MDC-2 ou à la récente proposition MJH de Lee et Stam (CT-RSA '11) .  ...  Pure Tensors in ℑ(C pre ) As F n r 2 e is isomorphic (as vector space over F 2 e ) to the tensor product F r 2 e ⊗ F n 2 e this leads in a natural way to a function from F r 2 e × F n 2 e to {0, 1} r en  ... 
doi:10.5075/epfl-thesis-5333 fatcat:3fonrx6imffapjvs3nnv5khjoa

Symmetric Cryptography (Dagstuhl Seminar 12031) Learning in Multiobjective Optimization (Dagstuhl Seminar 12041) Analysis of Executables: Benefits and Challenges (Dagstuhl Seminar 12051)

Robert Hirschfeld, Shriram Krishnamurthi, Jan, Verónica Becher, Laurent Bienvenu, Rodney Downey, Elvira Mayordomo, Frederik Armknecht, Stefan Lucks, Bart Preneel, Phillip Rogaway, Salvatore Greco (+6 others)
2012 Foundations for Scripting Languages   unpublished
Acknowledgments Many thanks to the Dagstuhl office and its helpful and patient staff; huge thanks to the organizers of the previous seminars in the series for setting us up for success; and thanks to all  ...  In the appendix, we also give special thanks to Kaisa Miettinen and Eckart Zitzler as they step down from the organizer role. Participants  ...  This is similar to the well-known MDC-2 or the recently proposed MJH by Lee and Stam (CT-RSA'11).  ... 
fatcat:avothr4qzfbxlbs2hgjdkccu2i