MJH: A Faster Alternative to MDC-2

DOI10.1007/978-3-642-19074-2_15zbMath1284.94087OpenAlexW1524358972MaRDI QIDQ3073709

Martijn Stam, Jooyoung Lee

Publication date: 11 February 2011

Published in: Topics in Cryptology – CT-RSA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19074-2_15

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

Blockcipher-Based Double-Length Hash Functions for Pseudorandom Oracles ⋮ Open problems in hash function security ⋮ Double-block-length hash function for minimum memory size ⋮ MJH: a faster alternative to MDC-2 ⋮ Optimal collision security in double block length hashing with single length key ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Attacks on fast double block length hash functions
• Blockcipher-Based Hashing Revisited
• On the Security of Tandem-DM
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• MD4 is Not One-Way
• Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation
• Security Analysis of the Mode of JH Hash Function
• Preimages for Reduced SHA-0 and SHA-1
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Analysis of Step-Reduced SHA-256
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Cryptanalysis of MDC-2
• Finding Preimages in Full MD5 Faster Than Exhaustive Search
• Related-Key Cryptanalysis of the Full AES-192 and AES-256
• Security of Cyclic Double Block Length Hash Functions
• Another Glance at Double-Length Hashing
• The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• Collisions of SHA-0 and Reduced SHA-1
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• How to Build a Hash Function from Any Collision-Resistant Function
• Cryptography and Coding
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• Finding Collisions in the Full SHA-1
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Hash Functions and RFID Tags: Mind the Gap

This page was built for publication: MJH: A Faster Alternative to MDC-2