Hash functions based on block ciphers and quaternary codes
From MaRDI portal
Recommendations
Cited in
(23)- Cryptanalysis of the Yi-Lam hash
- Collision attacks against the Knudsen-Preneel compression functions
- Blockcipher-Based Hashing Revisited
- On high-rate cryptographic compression functions
- Edon- R (256,384,512) -- an efficient implementation of Edon- R family of cryptographic hash functions.
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- scientific article; zbMATH DE number 503327 (Why is no real title available?)
- On the power of memory in the design of collision resistant hash functions
- An attack on two hash functions by Zheng-Matsumoto-Imai
- Hash functions based on block ciphers: A synthetic approach
- Security of iterated hash functions based on block ciphers
- Fast and secure hashing based on codes
- HCC: A hash function using error correcting codes
- scientific article; zbMATH DE number 1942817 (Why is no real title available?)
- A new hash function based on block cipher
- Making hash functions from block ciphers secure and efficient by using convolutional codes
- Estimates of the neighborhood volumes of binary codes via their weight spectra
- Cryptographic Hash Functions and Some Applications to Information Security
- Provably Good Codes for Hash Function Design
- Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes
- Cryptographic Hash Algorithms Based on Time Averaging Techniques
- Block-cipher-based tree hashing
- A new black box analysis of hash functions based on block ciphers
This page was built for publication: Hash functions based on block ciphers and quaternary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536253)