A New Implementation of SHA-3 Hash Function Using Seed Value

This paper aimed to suggest a new Secured Hash Algorithm 3 (SHA-3) with seed value implementation. Seed worth ensuring that there are fewer expectations collisions, despite an attacker selecting the data. Furthermore, attackers who combine seed values with hash functions are prevented from exploiting the properties of a hash function to construct many security attacks, such as denial of service attacks and dictionary attacks. A novel approach to enhanced SHA-3 diffusion was proposed here by XORing the seed value with $\theta$ step result after transforming the seed bits into a $5 \times 5 \times 64$ matrix and discarding the rest.