My goal here is not to obtain the most secure algorithm ever... I need something simple and fast enough to be describe as an appendix of my paper... I can't afford a long and complicated stuff because it is not a paper on computer science in particular but on math in general and even if I was free to choose any math-related topic there are some limits...
So here comes the fun. The link below points to a XOR encrypted version of my paper in its current state. I use the last version of the algorithm I proposed so all you have to do is to break the first block. However there are some difficulties :However you have some insights : it's written in english, it deals with "algorithms", "computational complexity", "cryptography", ...
- AFAIK the only way to break it is a brute-force attack or a stunning luck...
- The key is rather big say between 15 and 25 chars => 120 and 200 bits => quite a number of possibilities...
- The input data is compressed due to the file format used (a "all-in one" document with text formatting and embedded images...)
The encrypted file!
Good luck to the ones who won't be able to resist and attempt to crack it!
P.S : if you managed to break the code may you take a look at it and report mistakes in the content or the expression (english is not my native language...)
Bookmarks