USING SIMD TECHNOLOGY TO ACCELERATE SHA-2 FAMILY HASHING FUNCTIONS
Bakalavr, BMSTU, Moscow, Russia, George V. Belkov, Nikolay V. Bezverkhniy, Doctor of Science (Mathematics), Docent, BMSTU, Moscow, Russia · SOFT MEASUREMENTS AND COMPUTING · 2025
The article presents an approach to the design and development of software code for algorithms of cryptographically resistant hash functions of the SHA-2 family (Secure Hash Algorithm Version 2), which allows to speed up the calculation of the hash code of a message by an order of magnitude. A rigorous justification of the correctness of SIMD optimization is presented: it is proven that the output hash value of the optimized algorithm is identical to the classical SHA-256 for any input message. The main disadvantages of this approach and limitations associated with the peculiarity of the processor architecture are indicated. For convenience, the SHA-256 function is chosen as the object of consideration, however, all the results obtained are easily transferred to the cases of SHA-384, SHA-512.