| If you've done it right, there is also another bonus code inside! Thanks. |
==> |
| Thank you. I got it working. That was a good learn lesson. |
==> |
| Ahh html brackets are removed here... my formation is gone.
I meant to write if input key is lower then 8 then is processes byte for byte and if it's higher or equal 8 SIMD processing is used. |
==> |
| Thanks for the tip. Bypassing the patching protection was quite easy IMO. But I really struggle with that hash algorithm to just "generate" a valid key.
My insights:
1) If input key is = 8 characters it uses SIMD processing. Im relativly new to this stuff of reverse-engineering. Right now I would say that the hash results equals each path. However, I'm unsure.
Reverse calculation of the hash is from my insights "impossible". |
==> |
| Is the password stored in the executable? My guess is no.
I got the algorithm working and the correct hash-value of 0x84004833. But I'm stuck getting to the key on my own now. Any tips? |
==> |
| Vigenère algorithm, also nice fakes. |
==> |
| This was nice. Also, there's a buffer overflow possibility in. |
==> |
| Was fun! Am I right, that there was some RNG_SEED distraction right in the beginning? |
==> |