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
Citations0GitHub0β˜…HF0
𝕏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)β€”

Stay Updated

E-Mail Digest

Submit a paper Β· Privacy Β· Terms

Β© 2026 Awesome Papers.