Rogaway, P., Shrimpton, T.: Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision-Resistance. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 371–388. Springer, Heidelberg (2004)...
function). A minimal requirement for a hash function to be preimage resistant is that the length of its result should be at least 80 bits (in 2004). Preimage resistance needs to be distinguished from two other properties of hash functions:second preimage resistanceandcollision resistance. A hash...
Preimage Resistance 来自 Springer 喜欢 0 阅读量: 100 作者: B Preneel 摘要: Preimage resistance is the property of a hash function that it is hard to invert, that is, given an element in the range of a hash function, it should be computationally infeasible to find an input that maps to ...
但是实际上根据CRHF定义，如果一个函数是抗碰撞的，指的是任何多项式时间敌手，不能在多项式时间内，以不可忽略概率找到x1≠x2，且h(x1)=h(x2)，这样即为collision resistant。这代表可能存在不同输入但是对应相同输出，只要无法在多项式时间内以不可忽略概率找到即可满足条件。对于h'(x)，如果仅仅存在一组碰撞值...
Second-preimage resistanceWe propose a new construction for Merkle authentication trees which does not require collision resistant hash functions; in contrast with previous constructions that attempted to avoid the dependency on collision resistance, our technique enjoys provable security assuming the well-...
In this paper, we study the preimage resistance of the Maelstrom-0 hash function using its proposed 3CM chaining construction. More precisely, we apply a meet-in-the-middle preimage attack on the compression function and combine it with a guess and determine approach which allows us to obtain ...
D'Halluin, "Collision and Preimage Resistance of the Centera Content Address - Primmer, C - 2005 () Citation Context ...upted for whatever reason. Typically, object stores will use some combination of hashing and/or direct binary comparisons to guarantee that the stored data is the data ...
hash functionpreimage resistanceWe present new techniques for deriving preimage resistance bounds for block cipher based double-block-length, double-call hash functions. We give improved bounds on the preimage security of the three "classical" double-block-length, double-call, block cipher-based ...
Whirlwind is a keyless AES-like hash function that adopts the Sponge model. According to its designers, the function is designed to resist most of the recent cryptanalytic attacks. In this paper, we evaluate the second preimage resistance of the Whirlwind hash function. More precisely, we apply...
Message Authentication Code (MAC) is a cryptographic hash function that uses the cryptographic key(s) to generate a MAC value or a tag. MAC security property that must be satisfied is the second preimage resistance; given an input, it is difficult to find different inputs with the same tag...