An analysis of the blockcipher-based hash functions from PGV

DOI10.1007/s00145-010-9071-0zbMath1201.94077OpenAlexW2145006563MaRDI QIDQ604636

Martijn Stam, Phillip Rogaway, John Black, Thomas Shrimpton

Publication date: 12 November 2010

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: http://infoscience.epfl.ch/record/172411

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Open problems in hash function security ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Simpira v2: A Family of Efficient Permutations Using the AES Round Function ⋮ Security of truncated permutation without initial value ⋮ Probably Secure Keyed-Function Based Authenticated Encryption Schemes for Big Data ⋮ Hash Functions from Defective Ideal Ciphers ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ The Symbiosis between Collision and Preimage Resistance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the impossibility of highly-efficient blockcipher-based hash functions
• Distinguisher and Related-Key Attack on the Full AES-256
• Message Authentication Codes from Unpredictable Block Ciphers
• Blockcipher-Based Hashing Revisited
• On the Security of Tandem-DM
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation
• Stam’s Collision Resistance Conjecture
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
• Salvaging Merkle-Damgård for Practical Applications
• Communication Theory of Secrecy Systems*
• Security of Cyclic Double Block Length Hash Functions
• Another Glance at Double-Length Hashing
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model
• Merkle-Damgård Revisited: How to Construct a Hash Function
• On the Indifferentiability of the Sponge Construction
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Fast Software Encryption
• Theory of Cryptography
• How to protect DES against exhaustive key search (an analysis of DESX).
• The security of the cipher block chaining message authentication code
• One Way Hash Functions and DES

This page was built for publication: An analysis of the blockcipher-based hash functions from PGV