Preimage Resistance 来自 Springer 喜欢 0 阅读量: 97 作者: 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 ...
IMA Conference on Cryptography and CodingAndreeva, E., Stam, M.: The symbiosis between collision and preimage resistance. In: IMA International Conference 2011. Lecture Notes in Computer Science, vol. 7089, pp. 152-171. Springer, Heidelberg (2011)...
In this paper, we introduce a new notion of security, called adaptive preimage resistance. We prove that a compression function that is collision resistant and adaptive preimage resistant can be combined with a public random function to yield a hash function that is indifierentiable from a random...
Preimage resistance of several hash functions has already been broken by the meet-in-the-middle attacks and they utilize a property that their message schedules consist of only permutations of message words. It is unclear whether this type of attacks is applicable to a hash function whose message...
Preimage Resistance: given a target T, it should be computationally difficult, up to a bound of 2n, to find M such that H(M)=T. In this paper, we focus on preimage resistance. There are many known attack methods against the hash functions. We pay our attention to the splice-and-cut...
Preimage resistance is the property of ahashfunctionthat 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 that element. This property corresponds to one-wayness, which is typically used fo...
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 Kazumaro Aoki and Yu Sasaki NTT, 3-9-11 Midoricho, Musashino-shi, Tokyo 180-8585 Japan Abstract. Preimage resistance of several hash functions has already been broken by the meet-in-the-middle attacks and they utilize a...
Computer Science - Cryptography and SecurityQuantum PhysicsWe propose a preimage attack against cryptographic hash functions based on the speedup enabled by quantum computing. Preimage resistance is a fundamental property cryptographic hash functions must possess. The motivation behind this work relies in ...
CryptographyIn this paper, we give a concrete analysis of preimage resistance for a wide class of linearly-dependent permutation-based compression functions. Specifically, we prove the preimage resistance of LP m k r with r = m − 1 up to 2 ( k − 1 ) n k − log n queries. As...
cryptographyIn this paper, we give a concrete analysis of preimage resistance for a wide class of linearly-dependent permutation-based compression functions. Specifically, we prove the preimage resistance of LPmkr with r = m - 1 up to 2((k-1)n/k-logn) queries. As a special case, the ...