METHODS OF PARALLEL HASHING INFEASIBLE TO GENERIC ATTACKS

Authors

  • Yurii Baryshev Vinnytsia National Technical University
  • Andrii Komarov Vinnytsia National Technical University

Keywords:

hashing, parallel hashing, multicollision, Joux attack, hash construction, reduction function

Abstract

The given paper contains the analysis of modern state-of-art of hash functions and the attacks on them. As a result of the carried out analysis, it is determined that one of the most dangerous are generic attacks, based on multicollisions. To improve the infeasibility of constructions, providing paralleling a number of hashing constructions and algorithms have been suggested. Reduction functions of hashing methods on the base of these constructions are determined. Experimental research, carried out enabled to confirm the improvement of infeasibility of the given hashing method to generic attacks on the base of multicollisions.

Author Biographies

Yurii Baryshev, Vinnytsia National Technical University

Cand. Sc. (Eng), Assistant Professor with Information protection Department

Andrii Komarov, Vinnytsia National Technical University

Master's student with Information protection Department

References

1. Баришев Ю. В. Методи та засоби швидкого багатоканального гешування даних в комп’ютерних системах : монографія / Ю. В. Баришев, В. А. Лужецький; за заг. ред. В. А. Лужецького. – Вінниця : ВНТУ, 2016. – 144 с.
2. Gauravaram P. Cryptographic Hash Functions: Cryptanalysis, Design and Applications [Електронний ресурс] / Praveen Gauravaram. – 2009. – 298 c. – Режим доступу до ресурсу: http://eprints.qut.edu.au/16372/1/Praveen_Gauravaram_Thesis.pdf. – Назва з екрану.
3. Joux A. Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions / Antoine Joux // Lecture Notes in Computer Science. – 2004. – № 3152. – C. 306 – 316
4. Kelsey J. Second preimages on n-bit hash functions for much less than 2n work / J. Kelsey, B. Schneier // EUROCRYPT. – 2005. – P. 474 – 490.
5. Lucks S. Design Principles for Iterated Hash Functions [Електронний ресурс] / S. Lucks // Cryptology ePrint Archive. – 2004. – 22 c. – Режим доступу до ресурсу: http://eprint.iacr.org/2004/253.pdf. – Назва з екрану.
6. Preneel B. Analysis and Design of Cryptographic Hash Functions: PhD thesis [Електронний ресурс] / Bart Preneel. – Leuven: Katholieke Universiteit Leuven, 1993. – 323 c. – Режим доступу до ресурсу: http://homes.esat.kuleuven.be/~preneel/phd_preneel_feb1993.pdf. – Назва з екрану.
7. Schneier B. Applied Cryptography, Second edition: Protocols, Algorithms, and Source Code in C / Bruce Schneier. – New-York: Wiley Computer Publishing, John Wiley & Sons, Inc, 1996. – 1027 с.
8. Schneier B. The Skein Hash Function Family [Електронний ресурс] / [B. Schneier, N. Ferguson, S. Lucks and others]. – Режим доступу: URL https://www.schneier.com/skein1.3.pdf. – Назва з екрану.
9. Bertoni G. The Keccak sponge function family [Електронний ресурс] / G. Bertoni, J. Daemen, M. Peeters, G. V. Assche. – Режим доступу: URL http://keccak.noekeon.org/specs_summary.html. – Назва з екрану.
10. Secure Hash Signature Standard (SHS): FIPS PUB 180-2. – [Чинний від 2002-08-01]. Processing Standards Publication. – Gaithersburg 2002. – 76 с. (NIST).
11. Implementation of SHA-256 in C [Електронний ресурс] / Режим доступу: URL http://bradconte.com/sha256_c. – Назва з екрану.

Downloads

Abstract views: 243

Published

2016-12-13

How to Cite

[1]
Y. Baryshev and A. Komarov, “METHODS OF PARALLEL HASHING INFEASIBLE TO GENERIC ATTACKS”, Works of VNTU, no. 3, Dec. 2016.

Issue

Section

Information Technologies and Computer Engineering

Metrics

Downloads

Download data is not yet available.