View More View Less
  • 1 Military University of Technology, ul. Kaliskiego 2, 00-908 Warszawa, Poland
  • 2 Polish Academy of Sciences, ul. Jana Kazimierza 5, 01-248 Warszawa, Poland
Restricted access

Purchase article

USD  $25.00

1 year subscription (Individual Only)

USD  $800.00

HaF is a family of hash functions developed in Poland at Poznán University of Technology, see [1, 2]. It is a classical Merkle-Damgård construction with the output sizes of 256, 512 or 1024 bits. In this paper we present a collision attack with negligible complexity (collisions can be found without using a computer) for all the members of HaF family. We have also shown that the improved function (without the critical transformation) is still insecure. It is possible to find a preimage for a short message with the complexity lower than the exhaustive search. We are also able to create some fixed points with a complexity of single compression function call.

  • [1]

    Bilski, T., Bucholc, K., Grocholewska-Czuryło, A. and Stokłosa, J., HaF — A new family of hash functions, PECCS 2012 — Proceedings of the 2nd InternationalConference on Pervasive Embedded Computing and CommunicationSystems, Rome, Italy, 2426 February, 2012, pp. 188195, SciTePress, 2012.

    • Search Google Scholar
    • Export Citation
  • [2]

    Bilski, T., Bucholc, K., Grocholewska-Czuryło, A. and Stokłosa, J., Parameterized Hash Functions, Annales UMCS, sec. AI (Informatica), Volume XII, Issue 3, pp. 1124, Versita, 2012.

    • Search Google Scholar
    • Export Citation
  • [3]

    Damgård, I. B., A Design Principle for Hash Functions, Advances in Cryptology — CRYPTO ’89, Lecture Notes in Computer Science Vol. 435, pp. 416427, Springer-Verlag, 1990.

    • Search Google Scholar
    • Export Citation
  • [4]

    Menezes, A. J., van Oorschot, P. C. and Vanstone, S. A., Handbook of Applied Cryptography, CRC Press, Boca Raton, FL, 1996.

  • [5]

    Merkle, R. C., Secrecy, Authentication, and Public Key Systems, Technical Report No. 1979-1, pp. 1115, Information Systems Laboratory, Stanford University, 1979.

    • Search Google Scholar
    • Export Citation
  • [6]

    National Institute of Standards and Technology. (2005, Apr.) SHA-3 Competition (2007–2012). [Online]. Available: http://www.nist.gov/hash-competition

    • Search Google Scholar
    • Export Citation