Go to file
2021-09-22 22:27:53 +02:00
.gitignore Better loss tracking and implemented saving of network-wheights 2021-09-21 09:49:27 +02:00
discriminate.py bs-constant now only in one place and updated README 2021-09-22 22:27:53 +02:00
model.py bs-constant now only in one place and updated README 2021-09-22 22:27:53 +02:00
README.md bs-constant now only in one place and updated README 2021-09-22 22:27:53 +02:00
shark.py bs-constant now only in one place and updated README 2021-09-22 22:27:53 +02:00
train.py Smol changes on parameters 2021-09-22 18:53:56 +02:00
wh_discriminator.n Sucessful discrimination; updated README 2021-09-21 16:00:43 +02:00

Shark

Shark is a sha256+xor based encryption.
I made it because I want to try to break it.
(Precisely: Show it does not provide semantic security, because it is not IND-CPA-secure)
This will work iff I succeed in building a PPT-discriminator for sha256 from randomness
As my first approach this discriminator will be based on an LSTM-network.
Update: This worked out way better than expected; given long enought sequences (128 Bytes are more than enough) we can discriminate successfully in 100% of cases.
Update 2: I did an upsie in the training-code and the discriminator is actually shit.
Update 3: Turns out: sha256 produces fairly high quality randomness and this project seems to have failed...