On a Probabilistic Approach to the Security Analysis of Cryptographic Hash Functions
On a Probabilistic Approach to the Security Analysis of Cryptographic Hash Functions
复制标题
密码散列函数安全分析的概率方法
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
G. Schmid
中科院分区：
文献类型：
--
作者：
G. Laccetti;G. Schmid
在本文中，我们重点关注加密哈希函数的三个基本安全要求，通常称为原像、第二原像和抗碰撞性。我们在攻击不利用哈希函数计算方式的情况下检查这些安全要求，将它们表示为适当随机算法的成功概率。我们给出了此类阻力指数的精确数学表达式，并获得了它们与散列函数结果的均匀性相关的函数行为。我们的工作为加密哈希函数的研究提供了一个数学框架，使我们能够为一些流行的信念提供证据。
In this paper we focus on the three basic security requirements for a cryptographic hash function, commonly referred as preimage, second preimage and collision resistance. We examine these security requirements in the case of attacks which do not take advantage on how the hash function is computed, expressing them as success probabilities of suitable randomized algorithms. We give exact mathematical expressions for such resistance indices, and obtain their functional behaviour in relation to the amount of uniformity in the hash function outcomes. Our work provides a mathematical framework for the study of cryptographic hash functions, which enable us to give proofs for some prevailing beliefs.