Construction of the Initial Structure for Preimage Attack of MD5

@article{Mao2009ConstructionOT,
  title={Construction of the Initial Structure for Preimage Attack of MD5},
  author={Ming Mao and Shaohui Chen and J. Xu},
  journal={2009 International Conference on Computational Intelligence and Security},
  year={2009},
  volume={1},
  pages={442-445}
}
  • Ming Mao, Shaohui Chen, J. Xu
  • Published 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… CONTINUE READING
    4 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    A Multilayer Secured Messaging Protocol for REST-based Services
    METHODS OF SECURING IN-VEHICLE NETWORKS
    • 1
    • PDF

    References

    SHOWING 1-10 OF 15 REFERENCES
    Finding Preimages in Full MD5 Faster Than Exhaustive Search
    • 190
    • Highly Influential
    • PDF
    Preimage Attacks on Step-Reduced MD5
    • 34
    Preimages for Reduced SHA-0 and SHA-1
    • 81
    • PDF
    Preimage Attacks on One-Block MD4, 63-Step MD5 and More
    • 147
    • PDF
    How to Break MD5 and Other Hash Functions
    • 1,484
    • Highly Influential
    • PDF
    Cryptanalysis of the Hash Functions MD4 and RIPEMD
    • 462
    • PDF
    Efficient Collision Search Attacks on SHA-0
    • 426
    • PDF
    The MD5 Message-Digest Algorithm
    • 3,896
    • Highly Influential
    • PDF
    Improved Collision Attack on Hash Function MD5
    • 19
    A New Differential for MD5 With Its Full Differential Path
    • Journal of Computer Science andTechnology . Jan .
    • 2008