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

    • Export Citation

The author instruction is available in PDF.

Please, download the file from HERE

Manuscript submission: HERE

 

  • Impact Factor (2019): 0.486
  • Scimago Journal Rank (2019): 0.234
  • SJR Hirsch-Index (2019): 23
  • SJR Quartile Score (2019): Q3 Mathematics (miscellaneous)
  • Impact Factor (2018): 0.309
  • Scimago Journal Rank (2018): 0.253
  • SJR Hirsch-Index (2018): 21
  • SJR Quartile Score (2018): Q3 Mathematics (miscellaneous)

Language: English, French, German

Founded in 1966
Publication: One volume of four issues annually
Publication Programme: 2020. Vol. 57.
Indexing and Abstracting Services:

  • CompuMath Citation Index
  • Mathematical Reviews
  • Referativnyi Zhurnal/li>
  • Research Alert
  • Science Citation Index Expanded (SciSearch)/li>
  • SCOPUS
  • The ISI Alerting Services

 

Subscribers can access the electronic version of every printed article.

Senior editors

Editor(s)-in-Chief: Pálfy Péter Pál

Managing Editor(s): Sági, Gábor

Editorial Board

  • Biró, András (Number theory)
  • Csáki, Endre (Probability theory and stochastic processes, Statistics)
  • Domokos, Mátyás (Algebra (Ring theory, Invariant theory))
  • Győri, Ervin (Graph and hypergraph theory, Extremal combinatorics, Designs and configurations)
  • O. H. Katona, Gyula (Combinatorics)
  • Márki, László (Algebra (Semigroup theory, Category theory, Ring theory))
  • Némethi, András (Algebraic geometry, Analytic spaces, Analysis on manifolds)
  • Pach, János (Combinatorics, Discrete and computational geometry)
  • Rásonyi, Miklós (Probability theory and stochastic processes, Financial mathematics)
  • Révész, Szilárd Gy. (Analysis (Approximation theory, Potential theory, Harmonic analysis, Functional analysis))
  • Ruzsa, Imre Z. (Number theory)
  • Soukup, Lajos (General topology, Set theory, Model theory, Algebraic logic, Measure and integration)
  • Stipsicz, András (Low dimensional topology and knot theory, Manifolds and cell complexes, Differential topology)
  • Szász, Domokos (Dynamical systems and ergodic theory, Mechanics of particles and systems)
  • Tóth, Géza (Combinatorial geometry)

STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA
Gábor Sági
Address: P.O. Box 127, H–1364 Budapest, Hungary
Phone: (36 1) 483 8344 ---- Fax: (36 1) 483 8333
E-mail: smh.studia@renyi.mta.hu