https://github.com/osiris-unnefer/hash_partial_know_attack
attacks with only one tier of the known initial hash ,brute forcing, collision attack, partial collision
https://github.com/osiris-unnefer/hash_partial_know_attack
brute brute-force brute-force-attacks bruteforce bruteforce-attack hasahing hash md5 sha1 sha2
Last synced: 4 months ago
JSON representation
attacks with only one tier of the known initial hash ,brute forcing, collision attack, partial collision
- Host: GitHub
- URL: https://github.com/osiris-unnefer/hash_partial_know_attack
- Owner: Osiris-Unnefer
- Created: 2024-08-27T12:26:42.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2024-08-27T12:40:17.000Z (10 months ago)
- Last Synced: 2024-12-10T01:12:47.210Z (6 months ago)
- Topics: brute, brute-force, brute-force-attacks, bruteforce, bruteforce-attack, hasahing, hash, md5, sha1, sha2
- Language: Python
- Homepage:
- Size: 5.86 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README
Awesome Lists containing this project
README
Français :
attaques possibles : brute force, attaque de collisions, collision partielle, attaques avec seulement un tier du hash initial connue
avec ce programme vous pouvez trouver un hash en ayant simplement la moitié ou un tier, le script génére une suite de chiffres pour
ensuite la faire passer dans un algorithme de hashage et comparer le hash recherché aux hashs crée
si vous entrez une petite partie du hash initial vous aurez un grand nombre de "touché" et donc de faux positifs
SEULEMENT DES NOMBRES
English:
possible attacks: brute force, collision attack, partial collision, attacks with only one tier of the known initial hash
with this program you can find a hash by simply having half or one tier, the script generates a sequence of numbers and then pass it through an algorithm of hashage and compare the hash sought to the hashes created
if you enter a small part of the initial hash you will have a large number of "touched" and therefore false positives
ONLY NUMBERS