Hash Functions from Defective Ideal Ciphers
From MaRDI portal
Publication:2790047
DOI10.1007/978-3-319-16715-2_15zbMath1382.94127OpenAlexW2179372123MaRDI QIDQ2790047
Stefan Lucks, Aishwarya Thiruvengadam, Jonathan N. Katz
Publication date: 2 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16715-2_15
Cites Work
- An analysis of the blockcipher-based hash functions from PGV
- A construction of a cipher from a single pseudorandom permutation.
- The random oracle methodology, revisited
- Distinguisher and Related-Key Attack on the Full AES-256
- How Risky Is the Random-Oracle Model?
- Blockcipher-Based Hashing Revisited
- Security of Encryption Schemes in Weakened Random Oracle Models
- Constructing Rate-1 MACs from Related-Key Unpredictable Block Ciphers: PGV Model Revisited
- A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
- The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
- Communication Theory of Secrecy Systems*
- Related-Key Cryptanalysis of the Full AES-192 and AES-256
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Ideal-Cipher (Ir)reducibility for Blockcipher-Based Hash Functions
- A Simple Related-Key Attack on the Full SHACAL-1
- Related-Key Rectangle Attack on the Full SHACAL-1
- Constructing an Ideal Hash Function from Weak Ideal Compression Functions
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- A Related-Key Rectangle Attack on the Full KASUMI
- A Failure-Friendly Design Principle for Hash Functions
This page was built for publication: Hash Functions from Defective Ideal Ciphers
