Hash functions from defective ideal ciphers
From MaRDI portal
Recommendations
Cites work
- A construction of a cipher from a single pseudorandom permutation.
- A Failure-Friendly Design Principle for Hash Functions
- A practical-time related-key attack on the KASUMI cryptosystem used in GSM and 3G telephony
- A Related-Key Rectangle Attack on the Full KASUMI
- A Simple Related-Key Attack on the Full SHACAL-1
- An analysis of the blockcipher-based hash functions from PGV
- Blockcipher-Based Hashing Revisited
- Communication Theory of Secrecy Systems*
- Constructing an Ideal Hash Function from Weak Ideal Compression Functions
- Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
- Distinguisher and Related-Key Attack on the Full AES-256
- How Risky Is the Random-Oracle Model?
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Ideal-cipher (ir)reducibility for blockcipher-based hash functions
- Related-Key Cryptanalysis of the Full AES-192 and AES-256
- Related-Key Rectangle Attack on the Full SHACAL-1
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- Security of Encryption Schemes in Weakened Random Oracle Models
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- The random oracle methodology, revisited.
Cited in
(3)
This page was built for publication: Hash functions from defective ideal ciphers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790047)