HIGH-SPEED AND SECURE HASH FUNCTION FOR BLOCKCHAIN SECURITY MECHANISMS
ავტორი: Anatoliy Hrytsak, Vasyl Kinzeryavyy, Dmytro Prysiazhnyi, Yuliia Burmak, Yevhen Samoylik
ორგანიზაცია: 1Vinnytsia National Technical University, Vinnytsia, Ukraine, National Aviation University, Kyiv, Ukraine, Kyiv College of Communication, Kyiv, Ukraine
საკვანძო სიტყვები: Information Communication Technologies, Cybersecurity, Blockchain Security, High-Speed, Hash Function, Data Processing, Confidentiality and Integrity
აბსტრაქტი. Information communication technologies development and the emergence of new attack types leads to increasing the amount of existing hash functions vulnerabilities and other disadvantages. In every block-chain security mechanisms each block contains a cryptographic hash of the previous block, a timestamp, and transaction data. New hash function development is very actual and value research task. Thus, in this paper a new hash function was proposed, which was based on well-known hash function. Improvements involved a number of changes: increased the size of words and an increase in the message digest; at the pre-processing stage, the incoming message is supplemented by a pseudo-random sequence; the numbers of nonlinear functions are increased. The proposed changes allow reducing the number of rounds in the compression function, which will guarantee at least similar security indicators with simultaneous increase in data processing speed.
N. Aviram, S. Schinzel, J. Somorovsky, “DROWN: Breaking TLS using SSLv2, Proceedings of the 25th USENIX Security Symposium”, pp.18, 2016. [Online]. Available: https://drownattack.com/drown-attack-paper.pdf
M. Green, “Attack of the week: FREAK (or ‘factoring the NSA for fun and profit’)” [Online]. Available: https://blog.cryptographyengineering.com/2015/03/03/attack-of-week-freak-orfactoring- nsa/ | Date accesses: april 2018|.
B. Duncan, “Weak Diffie-Hellman and the Logjam Attack”, [Online]. Available: (https://weakdh.org/ | Date accesses: april 2018|.
P. Karpman, T. Peyrin, M. Stevens, “Practical Free-Start Collision Attacks on 76-step SHA- 1”, [Online]. Available: https://eprint.iacr.org/2015/530
S. Sanadhya, P. Sarkar, “22-Step Collisions for SHA-2” [Online]. Available: http://arxiv.org/abs/0803.1220
F. Kohlar, S. Schage, “On the Security of TLS-DH and TLS-RSA in the Standard Model1”, pp.50, 2013 [Online]. Available: http://eprint.iacr.org/2013/367.pdf
C. Meyer, J. Schwenk, “Chair for Network and Data Security Ruhr-University Bochum. Lessons Learned From Previous SSL/TLS Attacks A Brief Chronology Of Attacks And Weaknesses”, pp.15 [Online]. Available: http://eprint.iacr.org/2013/049.pdf
C. Castelluccia, E. Mykletun, “Improving Secure Server Performance by Re-balancing SSL/TLS Handshakes”. pp.11 (Published in “Proceeding ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security. pp 26-34”).
F. Mendel “Improving Local Collisions: New Attacks on Reduced SHA-256”, p.17 [Online]. Available: https://eprint.iacr.org/2015/350.pdf
C.Dobraunig, M. Eichlseder, “Analysis of SHA-512/224 and SHA-512/256”, p.30 [Online]. Available: https://eprint.iacr.org/2016/374.pdf
NIST Special Publication 800-22 “A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications” [Online]. Available:https://nvlpubs.nist.gov/nistpubs/legacy/sp/nistspecialpublication800-22r1a.pdf