Weaknesses in the HAS-V Compression Function

@inproceedings{Mendel2007WeaknessesIT,
  title={Weaknesses in the HAS-V Compression Function},
  author={F. Mendel and V. Rijmen},
  booktitle={ICISC},
  year={2007}
}
  • F. Mendel, V. Rijmen
  • Published in ICISC 2007
  • Computer Science, Mathematics
  • HAS-V is a cryptographic hash function which processes 1024-bit message blocks and produces a hash value of variable length. The design of the hash function is based on design principles of the MD4 family. Recently, weaknesses have been shown in members of this family. Therefore, the analysis of the HAS-V hash function is of great interest. To the best of our knowledge this is the first article that investigates the security of the HAS-V hash function. In this article, we point out several… CONTINUE READING
    25 Citations
    MD4 is Not One-Way
    • 99
    • PDF
    Preimage Attacks against PKC98-Hash and HAS-V
    • 1
    Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512
    • 10
    • PDF
    Preimages for Reduced SHA-0 and SHA-1
    • 81
    • PDF
    Automatic Search of Meet-in-the-Middle Preimage Attacks on AES-like Hashing
    • PDF
    Two Passes of Tiger Are Not One-Way
    • 6
    • PDF
    Cryptanalysis of MDC-2
    • 35
    • PDF
    Cryptanalysis of Hash Functions
    • PDF
    Analysis and design of symmetric cryptographic algorithms
    • PDF

    References

    SHOWING 1-10 OF 11 REFERENCES
    HAS-V: A New Hash Function with Variable Output Length
    • 16
    • PDF
    Colliding Message Pair for 53-Step HAS-160
    • 17
    • PDF
    How to Break MD5 and Other Hash Functions
    • 1,485
    • PDF
    Hash Function Based on Block Ciphers
    • 176
    • PDF
    A Study of the MD5 Attacks: Insights and Improvements
    • 82
    • PDF
    Cryptanalysis of the Full HAVAL with 4 and 5 Passes
    • 34
    • PDF
    Collision Search Attack for 53-Step HAS-160
    • 18
    Finding SHA-1 Characteristics: General Results and Applications
    • 261
    • PDF
    On the security of multiple encryption
    • 227
    • PDF
    Finding Collisions in the Full SHA-1
    • 1,514
    • PDF