Awesome Similarity Search
π
Papers
π§
Topics
π₯
Authors
π₯
Trending
πΊοΈ
Map
π
Leaderboards
π
Packs
π οΈ
Tools
π
Blogs
π€
Ask AI
βοΈ
Newsletter
π
Pro
+ Add Paper
βΎ
β
β all papers
Β·
overview
Collision Attacks on SHA-256 up to 37 Steps with Improved Trail Search
Zhuolong Zhang
Β·
Muzhou Li
Β·
Lei Gao
Β·
Meiqin Wang
Β·
2026
Citations
0
GitHub
0β
HF
0
π
π
in
βοΈ
arXiv:s2_c0c7617a85eb β
Google Scholar β
Semantic Scholar β
Uncategorized
Abstract
(no abstract)
Related papers
Relaxation of Strict Avalanche Criterion on All SHA-256 Sub-Function Combinations
(2026)
β
Faster CGL Hash Function via Reduced Backtracking Checks
(2026)
β
On the Quantum Collision Resistance of HCF Hash Functions
(2026)
β
An In-Class Activity Exploring Hash Function Quality
(2026)
β
Quantum Walk-Based Hash Function: Scalable Readout for Proof of Quantum Work
(2026)
β
Analysis of collision probability in Merkle trees in the random oracle model
(2026)
β
White-Box Attacks on PhotoDNA Perceptual Hash Function
(2026)
1.3
Generic Construction of Forward-Secure Chameleon Hash Function
(2026)
β