搜索结果: 1-15 共查到“密码学 SHA-3”相关记录85条 . 查询时间(0.062 秒)
From Collisions to Chosen-Prefix Collisions - Application to Full SHA-1
hash function cryptanalysis chosen-prefix collision
2019/5/13
A chosen-prefix collision attack is a stronger variant of a collision attack, where an arbitrary pair of challenge prefixes are turned into a collision. Chosen-prefix collisions are usually significan...
We study instantiating the random permutation of the block-cipher mode of operation IAPM (Integrity-Aware Parallelizable Mode) with the public random permutation of Keccak, on which the draft standard...
Exploiting an HMAC-SHA-1 optimization to speed up PBKDF2
HMAC-SHA-1 Password-Based Key Derivation Function 2 Boyar-Peralta heuristic
2018/1/29
PBKDF2 [27] is a well-known password-based key derivation function. In order to slow attackers down, PBKDF2 introduces CPU-intensive operations based on an iterated pseudorandom function (in our case ...
Keccak-based algorithms such as Secure Hash Algorithm-3 (SHA-3) will be widely used in crypto systems, and evaluating their security against different kinds of attacks is vitally important. This paper...
SHA-1 is a widely used 1995 NIST cryptographic hash function standard that was officially deprecated by NIST in 2011 due to fundamental security weaknesses demonstrated in various analyses and theoret...
Speeding up detection of SHA-1 collision attacks using unavoidable attack conditions
hash functions SHA-1 counter-cryptanalysis
2017/2/28
Counter-cryptanalysis, the concept of using cryptanalytic techniques to detect cryptanalytic attacks, was first introduced by Stevens at CRYPTO 2013 with a hash collision detection algorithm. That is,...
This paper presents an efficient algebraic fault analysis on all four modes of SHA-3 under relaxed fault models. This is the first work to apply algebraic techniques on fault analysis of SHA-3. Result...
Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
quantum cryptanalysis hash functions cost models
2016/12/8
We investigate the cost of Grover's quantum search algorithm when used in the context of pre-image attacks on the SHA-2 and SHA-3 families of hash functions. Our cost model assumes that the attack is ...
Discussions are currently underway about the choice of a
tree hash mode of operation for a standardization. It appears that a
single tree mode cannot address the specificities of all possible uses a...
In 2012, NIST standardized SHA-512/224 and SHA-512/256, two truncated variants of SHA-512, in FIPS 180-4. These two hash functions are faster than SHA-224 and SHA-256 on 64-bit platforms, while mainta...
Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256
Tree mode hashing SHA-256 SIMD architecture
2016/1/25
The j-lanes tree hashing is a tree mode that splits an input message to
j slices, computes j independent digests of each slice, and outputs the hash value
of their concatenation. The j-pointers tree...
Logical Reasoning to Detect Weaknesses About SHA-1 and MD4/5
Logical cryptanalysis MD5 SHA-1 Satisfiability
2016/1/23
In recent years, studies about the SATisfiability Problem (short for SAT) were more and more numerous because of its conceptual simplicity and ability to express a large set of various problems. Wit...
Branching Heuristics in Differential Collision Search with Applications to SHA-512
hash functions cryptanalysis SHA-512
2016/1/23
In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out of 80) steps with complexity 240.5 . The best previously published result was on 24 steps. The attack is b...
We present collisions for a version of SHA-1 with modified constants,
where the colliding payloads are valid binary files. Examples are given of colliding
executables, archives, and images. Our mali...
SHA-2 (SHA-224, SHA-256, SHA-384 and SHA-512) is hash
function family issued by the National Institute of Standards and Technology
(NIST) in 2002 and is widely used all over the world. In this work,...