![]() |
|
#3
|
|||
|
|||
|
Yes that sounds right. You can use techniques from linear cryptanalysis. My understanding is that this will lead to linear approximations for the function, but note that in this case the approximation will be exact, which should mean there is less computation involved.
By the way, if you solve the challenge you can give your solution as SHA256(your_name||solution) so that your solution is hidden but can be verified. |
| The Following User Says Thank You to dila For This Useful Post: | ||
chants (08-27-2018) | ||
| Tags |
| cryptography |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Yet another key extraction challenge (C++) | dila | General Discussion | 4 | 10-08-2016 16:49 |
| A nice challenge.... | hobgoblin | General Discussion | 1 | 01-28-2006 11:00 |