搜索结果: 1-8 共查到“军事学 SHA-256”相关记录8条 . 查询时间(0.069 秒)
Parallelized hashing via j-lanes and j-pointers tree modes, with applications to SHA-256
Tree mode hashing SHA-256 SIMD architecture
font style='font-size:12px;'>
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...
Improving Local Collisions: New Attacks on Reduced SHA-256
hash functions SHA-2 cryptanalysis
font style='font-size:12px;'>
2015/12/31
In this paper, we focus on the construction of semi-free-start collisions for SHA-256, and show how to turn them into collisions. We present a collision attack on 28 steps of the hash function with pr...
Higher-Order Differential Attack on Reduced SHA-256
hash functions higher-order differentials non-randomness boomerang attack SHA-256
font style='font-size:12px;'>
2011/2/23
In this work, we study the application of higher-order differential attacks on hash functions. We show a second-order differential attack on the SHA-256 compression function reduced to 46 out of 64 st...
Higher-Order Differential Attack on Reduced SHA-256
hash functions higher-order differentials non-randomness boomerang attack SHA-256
font style='font-size:12px;'>
2012/3/30
In this work, we study the application of higher-order differential attacks on hash functions. We show a second-order differential attack on the SHA-256 compression function reduced to 46 out of 64 st...
Preimage Attacks on 41-Step SHA-256 and 46-Step SHA-512
SHA-256 SHA-512 hash preimage attack
font style='font-size:12px;'>
2009/10/9
In this paper, we propose preimage attacks on 41-step SHA-256 and 46-step SHA-512,
which drastically increase the number of attacked steps compared to the best previous preimage attack working for on...
Attacking Reduced Round SHA-256
SHA-256 hash function. SHA-256 hash function
font style='font-size:12px;'>
2009/6/3
The SHA-256 hash function has started getting attention recently by the cryptanalysis community
due to the various weaknesses found in its predecessors such as MD4, MD5, SHA-0 and SHA-1. We make
two...
Collisions and other Non-Random Properties for Step-Reduced SHA-256
SHA-256 SHA-512 hash functions collisions
font style='font-size:12px;'>
2009/6/3
We study the security of step-reduced but otherwise unmodified
SHA-256. We show the first collision attacks on SHA-256 reduced
to 23 and 24 steps with complexities 218 and 228.5, respectively. We gi...
Analysis of Step-Reduced SHA-256
Step-Reduced SHA-256 Boolean function SHA-256
font style='font-size:12px;'>
2009/6/3
This is the first article analyzing the security of SHA-256
against fast collision search which considers the recent attacks by Wang
et al.We show the limits of applying techniques known so far to S...