Indifferentiability of double-block-length hash function without feed-forward operations

DOI10.1007/978-3-319-59870-3_3zbMATH Open1420.94088OpenAlexW2619324482MaRDI QIDQ2014605FDOQ2014605

Authors: Yusuke Naito 

Publication date: 25 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59870-3_3

Recommendations

• Optimally indifferentiable double-block-length hashing without post-processing and with support for longer key than single block
• On the indifferentiability of the Grøstl hash function
• A synthetic indifferentiability analysis of some block-cipher-based hash functions
• Some Plausible Constructions of Double-Block-Length Hash Functions
• A New Double-Block-Length Hash Function Using Feistel Structure
• Blockcipher-based double-length hash functions for pseudorandom oracles
• Towards Optimal Double-Length Hash Functions
• Indifferentiability characterization of hash functions and optimal bounds of popular domain extensions
• Cryptography and Coding
• Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function

zbMATH Keywords

blockcipherdouble-block-length hashfeed-forward operationspseudorandom oracle

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (3)

• Improved indifferentiability security bound for the prefix-free Merkle-Damgård hash function
• Crooked indifferentiability of enveloped XOR revisited
• Double-block-length hash function for minimum memory size

This page was built for publication: Indifferentiability of double-block-length hash function without feed-forward operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014605)