New Method of Hash Functions Analysis

This paper will illustrate a new class of analysis off hash functions. The method will be demonstrated on the algorithm SHA-256. The idea behind the attack is to represent the algorithm as Boolean equations and solve them using tree notation. The new attack will help to speed up the process of finding vulnerabilities in hash functions, which may help to create more secure hash functions in the future. Despite the fact that the article will describe the approbation of the method only on SHA-256, these results can also be extrapolated to other hashing algorithms, since the idea, presented in this method, does not depend on an algorithm specification.