A Python Programming Initiative for Hash Construction through the Example of SHA-2 | Chapter 8 | Finite Abelian Groups, Elliptic Curves, Blockchain with Hashing and Graphs

 

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.

 

 

Author(s) Details

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.

 

Please see the book here:- https://doi.org/10.9734/bpi/mono/978-81-992493-9-4/CH8