Construction of the Initial Structure for Preimage Attack of MD5

  title={Construction of the Initial Structure for Preimage Attack of MD5},
  author={Ming Mao and Shaohui Chen and Jin Xu},
  journal={2009 International Conference on Computational Intelligence and Security},
  • Ming Mao, Shaohui Chen, Jin Xu
  • Published 11 December 2009
  • Computer Science
  • 2009 International Conference on Computational Intelligence and Security
The construction of the initial structure for preimage attack of MD5 is proposed in this paper. With the help of “divide-and-rule” technique, the successful possibility of the construction is higher than 2-32 . Our construction is based on the MD5 structure, the message modification technique which is improved from Wang’ s. Some related techniques such as the extential form of the signed difference and special role of MSB are applied. According to Sasaki’ s thought, the initial structure… Expand
C-A1-01: Using Data Transformations, Derived Values, and Cryptographic Functions to Protect PHI in the VDW
  • Daniel Ng
  • Computer Science
  • Clinical Medicine & Research
  • 2011
Stewards of research data, like the VDW, should adopt the use mathematical functions, including cryptographic hash functions, to transform PHI into derived values, to enhance security and reduce compliance risk during routine data handling. Expand
Public Key Infrastructure based on Authentication of Media Attestments
This protocol is designed to enable a new breed of messaging clients with true end-to-end encryption built in, without the hassle of requiring users to manually manage the public keys, that is verifiably secure against MITM attacks, and does not require trusting any third parties. Expand
A Multilayer Secured Messaging Protocol for REST-based Services
The lack of a descriptive language and security guidelines poses a big challenge to implementing security in Representational State Transfer (REST) architecture and a secure messaging protocol is implemented. Expand


Finding Preimages in Full MD5 Faster Than Exhaustive Search
This paper presents the first cryptographic preimage attack on the full MD5 hash function, based on splice-and-cut and local-collision techniques that have been applied to step-reduced MD5 and other hash functions. Expand
Preimage Attacks on Step-Reduced MD5
It is shown that a preimage of a 44-step MD5 can be computed to a complexity of 296, and a pre image attack against variants of MD5 where the round order is modified from the real MD5 is considered. Expand
Preimages for Reduced SHA-0 and SHA-1
This paper examines the resistance of the popular hash function SHA-1 and its predecessor SHA-0 against dedicated preimage attacks and develops two new cryptanalytic techniques that obtain preimage-style shortcuts attacks for up to 45 steps ofSHA-1, and up to 50 steps of SHA- 0. Expand
Preimage Attacks on One-Block MD4, 63-Step MD5 and More
This paper shows preimage attacks on one-block MD4 and MD5 reduced to 63 (out of 64) steps. Our attacks are based on the meet-in-the-middle attack, and many additional improvements make the preimageExpand
How to Break MD5 and Other Hash Functions
A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure. Expand
Cryptanalysis of the Hash Functions MD4 and RIPEMD
A tubular aluminum housing, having vertically centered pinpoint light bulbs at either end in nose cones, is suspended on a stand by a gimbal system, and has an on-off switch and batteries such thatExpand
Efficient Collision Search Attacks on SHA-0
Using the new techniques, this paper can find collisions of the full 80-step SHA-0 with complexity less than 239 hash operations. Expand
The MD5 Message-Digest Algorithm
This document describes the MD5 message-digest algorithm. The algorithm takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.Expand
Improved Collision Attack on Hash Function MD5
It’s time to get ready for EuroOCRYPT 2005 again, this time with a vengeance. Expand
A New Differential for MD5 With Its Full Differential Path
  • Journal of Computer Science andTechnology . Jan .
  • 2008