The Grindahl Hash Functions
From MaRDI portal
Recommendations
- On the indifferentiability of the Grøstl hash function
- The hash function \texttt{BLAKE}
- scientific article; zbMATH DE number 1216232
- scientific article; zbMATH DE number 1722677
- Algorithmic aspects in speech recognition
- Parameterized hash functions
- Hash-functions using modulo-\(N\) operations
- scientific article; zbMATH DE number 1456817
- The whirlpool secure hash function
- Hash functions using chaotic iterations
Cited in
(19)- Security of truncated permutation without initial value
- Speeding up Collision Search for Byte-Oriented Hash Functions
- Parameterized hash functions
- Slide Attacks on a Class of Hash Functions
- The Hash Function Family LAKE
- RC hash function
- Cryptanalysis of Grindahl
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- Improved Impossible Differential Attacks on Large-Block Rijndael
- The hash function \texttt{BLAKE}
- Collision attack on \({\mathtt Grindahl}\)
- Automatic search of meet-in-the-middle preimage attacks on AES-like hashing
- Triangulating rebound attack on AES-like hashing
- Cryptanalysis of hash functions with structures
- Edon- R (256,384,512) -- an efficient implementation of Edon- R family of cryptographic hash functions.
- Open problems in hash function security
- Two Attacks on RadioGatún
- Tight preimage resistance of the sponge construction
- Duplexing the sponge: Single-pass authenticated encryption and other applications
This page was built for publication: The Grindahl Hash Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524880)
