On the Impossibility of Efficiently Combining Collision Resistant Hash Functions

Lecture Notes in Computer Science - Germany
doi 10.1007/11818175_34
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Power of Memory in the Design of Collision Resistant Hash Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Collision Resistance of the JH Hash Function

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2012English

On Hash Functions Using Checksums

International Journal of Information Security
Information SystemsRiskComputer NetworksCommunicationsReliabilitySafetyQualitySoftware
2009English

Parameterized Hash Functions

Annales UMCS, Informatica
2012English

Cryptographic Hash Functions

2010English

The State of Cryptographic Hash Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Collision Attacks on the Reduced Dual-Stream Hash Function RIPEMD-128

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Cryptanalysis of the ESSENCE Family of Hash Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy