Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Hash Function
Provable Security
Subscribe
Academic
Publications
MJH: A Faster Alternative to MDC2
MJH: A Faster Alternative to MDC2,10.1007/9783642190742_15,Jooyoung Lee,Martijn Stam
Edit
MJH: A Faster Alternative to MDC2
BibTex

RIS

RefWorks
Download
Jooyoung Lee
,
Martijn Stam
In this paper, we introduce a new class of doubleblocklength hash functions. In the ideal cipher model (for nbit blocks), we prove that these hash functions, dubbed MJH, are provably collision resistant up to O(2\frac2n3</font >logn)O(2^{\frac{2n}{3}\log n}) queries in the iteration. When based on nbit key blockciphers, our construction provides better
provable security
than MDC2, the only known construction of a rate1/2 doublelength
hash function
based on an nbit key blockcipher with nontrivial provable security. Moreover, since key scheduling is performed only once per message block for MJH, our proposal significantly outperforms MDC2 in efficiency. When based on a 2nbit key blockcipher, we can use the extra n bits of key to increase the amount of payload accordingly. Thus we get a rate1
hash function
that is much faster than existing proposals, such as TandemDM, at the expense of (for the moment) reduced provable security.
Conference:
The Cryptographer's Track at RSA Conference  CTRSA
, pp. 213236, 2011
DOI:
10.1007/9783642190742_15
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
More »
References
(35)
Security Analysis of the Mode of JH Hash Function
(
Citations: 5
)
Rishiraj Bhattacharyya
,
Avradip Mandal
,
Mridul Nandi
Conference:
Fast Software Encryption  FSE
, pp. 168191, 2010
Collisions of SHA0 and Reduced SHA1
(
Citations: 100
)
Eli Biham
,
Rafi Chen
,
Antoine Joux
,
Patrick Carribault
,
Christophe Lemuet
,
William Jalby
Conference:
Theory and Application of Cryptographic Techniques  EUROCRYPT
, pp. 3657, 2005
RelatedKey Cryptanalysis of the Full AES192 and AES256
(
Citations: 18
)
Alex Biryukov
,
Dmitry Khovratovich
Conference:
International Conference on the Theory and Application of Cryptology and Information Security  ASIACRYPT
, pp. 118, 2009
On the Impossibility of HighlyEfficient BlockcipherBased Hash Functions
(
Citations: 29
)
John Black
,
Martin Cochran
,
Thomas Shrimpton
Conference:
Theory and Application of Cryptographic Techniques  EUROCRYPT
, pp. 526541, 2005
Hash Functions and RFID Tags: Mind the Gap
(
Citations: 34
)
Andrey Bogdanov
,
Gregor Leander
,
Christof Paar
,
Axel Poschmann
,
Matthew J. B. Robshaw
,
Yannick Seurin
Conference:
Cryptographic Hardware and Embedded Systems  CHES
, pp. 283299, 2008