NIST announced it is seeking a new cryptographic hash algorithm to replace or extend the existing SHA-2 family of algorithms.
The existing algorithm is described by the FIPS PUB 180-1 standard.
I am exploring whether or not such a new algorithm might be devised that uses, at least to some extent, new approaches to fulfill the requirements for NIST cryptographic hash algorithms rather than simply extending SHA-2 by modifying the number of rounds executed, the bit length of the final digest result, or the order/mix of bitwise compound operation performed per round.
I am sure that I am not the first to wonder about new approaches to this problem so maybe the current approach is the best that can be found.
I'll keep exploring the concepts just for the hell of it....
