Characterizing Padding Rules of MD Hash Functions Preserving Collision Security

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-02620-1_12
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Javascript Security Using Cryptographic Hash Functions

Advanced Information Systems
2019English

On the Impossibility of Efficiently Combining Collision Resistant Hash Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

An Effective Algorithm for Collision Resolution in Security Policy Rules

Modeling and Analysis of Information Systems
2019English

On the Security of RSA Padding

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1999English

Collision Resistance of the JH Hash Function

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

Parameterized Hash Functions

Annales UMCS, Informatica
2012English

Cryptographic Hash Functions

2010English

Interpreting Hash Function Security Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy