sha256-simd
collisions
| sha256-simd | collisions | |
|---|---|---|
| 3 | 22 | |
| 938 | 2,920 | |
| 1.2% | 1.2% | |
| 1.0 | 6.7 | |
| 12 months ago | about 1 month ago | |
| Go | Python | |
| Apache License 2.0 | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
sha256-simd
-
The Curious Case of MD5
BLAKE3 is faster than hardware accelerated SHA-2 because the tree mode used in BLAKE3 allows hashing parts of a single message in parallel (with SHA-2, parts of a single message have to be hashed one after another, and parallelism is only used in workloads where you process multiple messages at the same time).
https://github.com/minio/sha256-simd
https://github.com/BLAKE3-team/BLAKE3
-
Can I concatenate multiple non-crypto hash functions to reduce collision?
SHA256 is high quality but typically a bit slower. Next Go version will have faster SHA256 on some amd64 CPUs - until then you can try sha256-simd which offers the same.
-
I need to find a custom hexadecimal string that when encrypted starts with a certain specific hexadecimal string(77656e6f7469 in our case). I tried randomly generating strings encrpyting them and checking them, realized it would take too much time. Any help?
I am not sure, if you can achieve a reasonable speed with Python though. You probably have to use a compiled language or run it on GPU. I found this very fast implemenation in Go which uses special CPU instructions (the AVX2 or SHA extensionsm depending on your CPU model) to speed up the calculation: https://github.com/minio/sha256-simd
collisions
- Hash Collisions and Exploitations
-
The Curious Case of MD5
That is still an attack on the second preimage or a collision resistance properties of the hash function. Most collisions do work this way, for example see [1].
[1] https://github.com/corkami/collisions
- Practical advice on finding hash collisions
- GitHub - corkami/collisions: Hash collisions and exploitations - a tool which can manipulate hash quines
-
The Epstein court documents have just been released, over 2000 pages with list of people on that island
it's easy to do if you have a few hours to spare
-
Totális biztonság E-kréta style
remelem nem checksum ellenorzesre https://github.com/corkami/collisions !
-
An open source file Hasher AND Verifier?
Sure, here are two different screenshots of your comment made with this tool:
- Hash collisions and exploitations – Instant MD5 collision
-
Hacker News top posts: Sep 20, 2022
Hash collisions and exploitations – Instant MD5 collision\ (4 comments)
What are some alternatives?
asm - Go library providing algorithms optimized to leverage the characteristics of modern CPUs
some-assembly-required - 📖 An approachable introduction to Assembly.
xxh3 - XXH3 algorithm in Go
quickhash - Graphical cross platform data hashing tool for Linux, Windows and Mac
asm - Learning assembly for linux-x64
jt89 - sn76489an compatible Verilog core, with emphasis on FPGA implementation and Megadrive/Master System compatibility
avo - Generate x86 Assembly with Go
EDLA - EDLA remote logic analyser, using ESP32 and Web protocols
cpu - cpu command in Go, inspired by the Plan 9 cpu command
cipher - Bitcoin wallet generator [Moved to: https://github.com/gocrazygh/btcwallet]
tinyfont - Text library for TinyGo displays
paracosme - Paracosme is a zero-click remote memory corruption exploit that compromises ICONICS Genesis64 which was demonstrated successfully on stage during the Pwn2Own Miami 2022 competition.