Some observations on the theory of cryptographic hash functions
From MaRDI portal
Publication:2491271
Recommendations
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Cryptography. Theory and practice
- Fast Software Encryption
- Generic groups, collision resistance, and ECDSA
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
Cited in
(34)- Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration
- Combiners for backdoored random oracles
- Necessary and sufficient conditions for collision-free hashing
- Practical chosen ciphertext secure encryption from factoring
- Decisional second-preimage resistance: when does SPR imply PRE?
- Construction of universal one-way hash functions: tree hashing revisited
- scientific article; zbMATH DE number 1722677 (Why is no real title available?)
- Formalizing human ignorance
- Correlated-input secure hash functions
- Expedient Non-malleability Notions for Hash Functions
- The symbiosis between collision and preimage resistance
- scientific article; zbMATH DE number 6351507 (Why is no real title available?)
- Chaotic hash function based on the dynamic S-box with variable parameters
- Dakota – Hashing from a Combination of Modular Arithmetic and Symmetric Cryptography
- Cryptanalysis of the GOST Hash Function
- How to Fill Up Merkle-Damgård Hash Functions
- Limits of Constructive Security Proofs
- Amplifying Collision Resistance: A Complexity-Theoretic Treatment
- Characterizing Padding Rules of MD Hash Functions Preserving Collision Security
- A Three-Property-Secure Hash Function
- scientific article; zbMATH DE number 177052 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- Low-complexity cryptographic hash functions
- Challenging the increased resistance of regular hash functions against birthday attacks
- Notes on a preimage-resistant hash function
- Cryptographic Hash Functions and Some Applications to Information Security
- Advances in Cryptology – CRYPTO 2004
- Brute force attacks on hash functions
- Impact of Rotations in SHA-1 and Related Hash Functions
- Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
- Some observations on the cryptographic hash functions
- Frontiers of Combining Systems
- Fast Software Encryption
- A caution on universal classes of hash functions
This page was built for publication: Some observations on the theory of cryptographic hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2491271)
