Combining Compression Functions and Block Cipher-Based Hash Functions

No abstract is available for this paper.

• Publication year

  2006

• Venue

  International Conference on the Theory and Application of Cryptology and Information Security

• Publication date

  2006-12-03

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/11935230_21
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Handbook of Applied Cryptography

  2018cited by this paper
• Some Plausible Constructions of Double-Block-Length Hash Functions

  2006cited by this paper
• How to Break MD5 and Other Hash Functions

  2005cited by this paper
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions

  2005cited by this paper
• Finding Collisions in the Full SHA-1

  2005cited by this paper
• Merkle-Damgård Revisited: How to Construct a Hash Function

  2005cited by this paper
• Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography

  2005cited by this paper
• A Failure-Friendly Design Principle for Hash Functions

  2005cited by this paper
• Second Preimages on n-bit Hash Functions for Much Less than 2n Work

  2005cited by this paper
• Security Analysis of a 2/3-Rate Double Length Compression Function in the Black-Box Model

  2005cited by this paper
• Some Attacks Against a Double Length Hash Proposal

  2005cited by this paper
• Multicollisions in Iterated Hash Functions. Application to Cascaded Constructions

  2004cited by this paper
• Provably Secure Double-Block-Length Hash Functions in a Black-Box Model

  2004influential reference
• Recommendation for the Triple Data Encryption Algorithm (TDEA) Block Cipher

  2004cited by this paper
• Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV

  2002cited by this paper
• Construction of secure and fast hash functions using nonbinary error-correcting codes

  2002cited by this paper
• A Generalized Birthday Problem

  2002cited by this paper
• Analysis of SHA-1 in Encryption Mode

  2001cited by this paper
• Formal aspects of mobile code security

  1999cited by this paper
• Analysis and design of cryptographic hash functions

  1999cited by this paper
• Fast and Secure Hashing Based on Codes

  1997influential reference
• Hash Functions Based on Block Ciphers and Quaternary Codes

  1996cited by this paper
• Random Oracles Are Practical: a Paradigm for Designing Eecient Protocols

  1995cited by this paper
• Security of Iterated Hash Functions Based on Block Ciphers

  1994cited by this paper
• New Attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel-DM

  1994influential reference
• Hash Functions Based on Block Ciphers: A Synthetic Approach

  1993cited by this paper
• Random oracles are practical: a paradigm for designing efficient protocols

  1993cited by this paper
• On the Power of Memory in the Design of Collision Resistant Hash Functions

  1992cited by this paper
• Markov Ciphers and Differential Cryptanalysis

  1991cited by this paper
• One-way hash functions

  1991cited by this paper
• 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms

  1990cited by this paper
• LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications

  1990cited by this paper
• Nonlinearity Criteria for Cryptographic Functions

  1990cited by this paper
• A Design Principle for Hash Functions

  1989cited by this paper
• Collision-free hashfunctions based on blockcipher algorithms

  1989cited by this paper
• One Way Hash Functions and DES

  1989cited by this paper

• T5: Hashing Five Inputs with Three Compression Calls

  2021cites this paper
• Design and Analysis of Cryptographic Algorithms for Authentication

  2017cites this paper
• General attacks on compression functions based on key alternating ciphers

  2017cites this paper
• A Collision Attack on a Double-Block-Length Compression Function Instantiated with 8-/9-Round AES-256

  2016cites this paper
• A proposal for high rate double-block-length hash functions

  2016cites this paper
• Efficient parallelizable hashing using small non-compressing primitives

  2016cites this paper
• Analysis of block cipher constructions against biclique and multiset attacks

  2016cites this paper
• Attacks on a double length blockcipher-based hash proposal

  2015cites this paper
• Collision Attack on Grindahl

  2015cites this paper
• Counter-bDM: A Provably Secure Family of Multi-Block-Length Compression Functions

  2014cites this paper
• A Collision Attack on a Double-Block-Length Compression Function Instantiated with Round-Reduced AES-256

  2013cites this paper
• On the (In)Security of IDEA in Various Hashing Modes

  2012cites this paper
• Optimal collision security in double block length hashing with single length key

  2012cites this paper
• Analysis of iterated block ciphers.

  2012cites this paper
• The PHOTON Family of Lightweight Hash Functions

  2011cites this paper
• Efficient Hashing using the AES Instruction Set

  2011cites this paper
• Analysis and design of block cipher constructions

  2010cites this paper
• Attacking the Knudsen-Preneel Compression Functions

  2010cites this paper
• Lightweight cryptography: cryptographic engineering for a pervasive world

  2009influential citation
• Cryptographic hash functions

  2009cites this paper
• Report regarding the winter school on Hash 3 : Proofs, Analysis and Implementation

  2009cites this paper
• Hash Functions and RFID Tags: Mind the Gap

  2008influential citation
• Analyse de fonctions de hachage cryptographiques

  2008cites this paper
• Building a Collision-Resistant Compression Function from Non-compressing Primitives

  2008cites this paper
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

  2008cites this paper
• Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function

  2008cites this paper
• SHA-3 Proposal: ECHO

  2008cites this paper
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions

  2008cites this paper
• Cryptanalysis of Grindahl

  2007cites this paper
• Hash Function Design Principles Supporting Variable Output Lengths from One Small Function

  2007cites this paper
• Security Analysis of Constructions Combining FIL Random Oracles

  2007cites this paper
• On Building Hash Functions from Multivariate Quadratic Equations

  2007cites this paper
• Cryptanalysis of T-Function-Based Hash Functions

  2006cites this paper
• Western European Workshop on Research in Cryptology

  2005cites this paper