A Python Programming Initiative for Hash Construction through the Example of SHA-2

Seddik Abdelalim

LMFA, FSAC, University Hassan II of Casablanca, Morocco.

Abdelkarim Lkoiaza

LMFA, FSAC, University Hassan II of Casablanca, Morocco.

Asmaa Cherkaoui

LMFA, FSAC, University Hassan II of Casablanca, Morocco.

Ilias Elmouki *

LMFA, FSAC, University Hassan II of Casablanca, Morocco.

Noreddine Abghour

LIS Labs, FSAC, University Hassan II of Casablanca, Morocco.

*Author to whom correspondence should be addressed.


Abstract

As opposed to the different methods used in the preprocessing and concatenation steps associated with Secure Hash Algorithm 1 (SHA-1), we treat here the case of Secure Hash Algorithm 2 (SHA-2) that is still unbreakable up to the present. In addition, before its implementation in Python, we first explain the difference between the two approaches.

Keywords: Data integrity verification, Hashing, Sha-1, Collision attack, Sha-2


How to Cite

Abdelalim, S., Lkoiaza, A., Cherkaoui, A., Elmouki, I., & Abghour, N. (2025). A Python Programming Initiative for Hash Construction through the Example of SHA-2. Finite Abelian Groups, Elliptic Curves, Blockchain With Hashing and Graphs, 264–278. https://doi.org/10.9734/bpi/mono/978-81-992493-9-4/CH8