From 188b077090de8ee6a22bdfa03b7b6af533342d01 Mon Sep 17 00:00:00 2001 From: PlexSheep Date: Sat, 22 Apr 2023 00:48:06 +0200 Subject: [PATCH] trying for preimage attack --- src/trash-hash.py | 45 +++++++++++++++++++++++++++++++++------------ 1 file changed, 33 insertions(+), 12 deletions(-) diff --git a/src/trash-hash.py b/src/trash-hash.py index e327a34..5bef3b2 100644 --- a/src/trash-hash.py +++ b/src/trash-hash.py @@ -5,7 +5,10 @@ Dirty hash we were covered in an excercise for Week 16 of 2023 in cryptography import math import random -DEFINED_INITIAL = bytearray(b'\xa5\xa5\xa5\xa5\x5a\x5a\x5a\x55\x55\x55\xaa\xaa\xaa') +DEFINED_INITIAL = bytearray(b'\xa5\xa5\xa5\xa5\x5a\x5a\x5a\x5a\x55\x55\x55\x55\xaa\xaa\xaa\xaa') +# the hash we want to find in the preimage attacks +# comes from 'AAAA' +THE_HASH = bytearray(b'\xe4\xe4\xe4\xe4\xa5\xa5\xa5\xa5\xaa\xaa\xaa\xaa\x55\x55\x55\x55') def trash_hash(input: bytearray) -> bytearray: #print("original len is %s" % len(input)) @@ -45,17 +48,6 @@ def trash_hash(input: bytearray) -> bytearray: return A def use(): - some_bytes = bytearray(b'AAAA'); - print("hashed: %s" % some_bytes.hex()) - print('='*80) - hashed = trash_hash(some_bytes) - print('='*80) - print("hashed: %s" % hashed.hex()) - -def test_collision(a: bytearray, b: bytearray) -> bool: - return trash_hash(a) == trash_hash(b) - -def main(): payload_a = bytearray(b"AAAA") # works, but is too cheap #payload_b = bytearray(b"AAAA\xff\xff") @@ -63,6 +55,35 @@ def main(): print("a: %s\nb: %s" % (trash_hash(payload_a).hex(), trash_hash(payload_b).hex())) print("identical: %s" % test_collision(payload_a, payload_b)) +def test_collision(a: bytearray, b: bytearray) -> bool: + return trash_hash(a) == trash_hash(b) + +def test_against_hash(input: bytearray, target_hash: bytearray) -> bool: + hashed = trash_hash(input) + print("hashed variant:\t%s" % hashed.hex()) + print("should be:\t%s" % THE_HASH.hex()) + return trash_hash(input) == target_hash + +def first_preimage(): + print("Trying to find a message that produces %s" % THE_HASH.hex()) + # a xor b = c + # c xor b = a + target = bytearray(b'\ff' * 16) + input = bytearray(b'\00' * 16) + between = bytearray(16) + # this is an arbituary target + # should work for anything + target[0] = ord('A') + + for i in range(0, 16): + between[i] = target[i] ^ THE_HASH[i] + input[i] = between[i] ^ THE_HASH[i] + + print(test_against_hash(input, THE_HASH)) + +def main(): + first_preimage() + def bruteForce() -> bool: payload_a = bytearray(b"AAAA") foundCollision = False