A Modern Cryptography Competition
The Mystery Of The Missing Silver › Forums › The Mystery Of The Missing Silver › A Modern Cryptography Competition
- This topic has 14 replies, 8 voices, and was last updated 2 hours, 13 minutes ago by Puzzling_Pelican.
-
AuthorPosts
-
-
9th November 2026 at 7:15 am #151071Puzzling_PelicanParticipant
This has been a while in the making, but over the past year I have been putting together another NCC inspired cryptography competition. This one (unlike my previous one that you may remember from last year) is based around modern cryptography.
The challenge will run between November 9th and March 9th and cover a variety of techniques relevant to modern day cryptography.
It primarily targets students from secondary school to university and through a hint system should help build up the knowledge needed to break each of its challenges. It won’t be easy but it will be fun.[Edited by Harry: You will find the link to the competition on the news article about it, also published today.]
- This topic was modified 1 month, 3 weeks ago by puzzling_pelican_admin.
- This topic was modified 2 weeks ago by Harry.
- This topic was modified 2 weeks ago by Harry.
- This topic was modified 2 weeks ago by Harry.
- This topic was modified 2 weeks ago by Harry.
-
9th November 2026 at 9:12 am #165902Elf_on_the_ShiftKeymaster
Thanks PP for this! It seems like the arcane ways of the forum mean that we had to go back a couple pages to find this thread, but hopefully this comment will bring it to the front! Any questions, comments, feedback or anything else relating to this competition should also be posted in this thread.
EotS
-
9th November 2026 at 3:26 pm #165929Puzzling_PelicanParticipant
Sorry about the rough start, if you tried submitting to the leaderboard within the first 15-20m you may have encountered an error, this should now have been fixed (a sneaky extra zero in a timestamp). Please resubmit if this was the case.
-
9th November 2026 at 4:43 pm #165937CrackerjackParticipant
Thank you for putting this together! It’s great to have something running through March as it’s always a bit bittersweet when the NCC season ends. I didn’t get around to many of your challenges last year, but I’m hoping to keep up with this one (degree deadlines permitting!)
-
9th November 2026 at 8:26 pm #165956Krishie-RamnathParticipant
Out of interest, is the paper in Challenge 1 real? I’ve found the author online, but I can’t seem to find the paper.
-
9th November 2026 at 10:35 pm #165966Puzzling_PelicanParticipant
No, the paper and the rest of the story is (thankfully, looking at some of the later parts of the story) entirely fictional.
You will not be expected to try track anything down from within the decrypts, there will be few if any clues within the actual decrypts.
That being said, it is a nice story I put together and a lot of time went into designing it such that it makes decrypting some of the later challenges more rewarding, so do enjoy reading it.
Good luck and enjoy mission 2 next Monday!
-
-
11th November 2026 at 12:49 am #166023madnessParticipant
@PP
Lemme know if you would like to purchase some cipher machines. -
11th November 2026 at 11:39 am #166063CrypticCrackerParticipant
very fun i would recommend
- This reply was modified 1 week, 1 day ago by chesstalk890.
- This reply was modified 1 week, 1 day ago by chesstalk890.
- This reply was modified 1 week, 1 day ago by chesstalk890.
-
11th November 2026 at 4:28 pm #166090WannaTryParticipant
Running into a network error when trying to make an account
-
12th November 2026 at 10:14 am #166121Puzzling_PelicanParticipant
Thanks for letting me know.
Could you potentially try again, but this time open inspect tools (ctrl + shift + i) and click on the network tab. See whether the “signup” request to the server is failing or being blocked (e.g. status 403 or 404)?
My first guess is that if it is being done on a school network, your filtering might not allow the request to the server (even though I intentionally picked a Cloudflare worker because they are usually trusted).
Sorry about this. -
12th November 2026 at 4:26 pm #166171WannaTryParticipant
Yeah, that was it
Thanks so much
looks great!
-
-
15th November 2026 at 8:17 pm #166352Puzzling_PelicanParticipant
Mission 2 comes out at 3pm this Monday.
It is not much harder than mission 1 yet. If you are finding it easy so far, don’t worry, by mission 10 you definitely won’t 🙂Congratulations to everyone who took part in Mission 1, especially to the approximately 60 of you who submitted a correct solution.
If you haven’t started yet, it is not too late, the first 3 missions are still warmups and don’t count towards your final score.
If you’re enjoying it and think your friends might too, please get them involved, it is fun and they can learn quite a lot.
As always, any questions about the challenge, especially if you cannot understand something after all the clues, please feel free to ask.
Best of luck with Mission 2!
Puzzling_Pelican
-
16th November 2026 at 3:56 pm #166369Puzzling_PelicanParticipant
And by this Monday, I mean today!
[Edited by EotS on 18th Nov – sorry for the delay in the post!]
-
-
18th November 2026 at 10:35 am #166446ByteInBitsParticipant
Challenge 1
In the last hint Python code was given for a decrypt, so here is what I used:
Using PARI-gp Version 2.13.3 code to decrypt MCC challenge 1
Note: The binary code was edited, each space was made a comma before copy
and paste to between [] brackets, here I have used the beginning and end of
of the code with added middle, showing the outputCT=[00001010,01001010,01101111,01100100,01101001,01100101,00001010,01011001,01101111,01110101,00100000,01101101,01100001,01111001,00100000,01110010,01100101,01101101,01100101,01101101,01100010,01100101,01110010,00100000,00101110,00100000,00101110,00100000,00101110,00100000,01110111,01101000,01100001,01110100,00100000,01101000,01100001,01110000,01110000,01100101,01101110,01100101,01100100,00100000,01110100,01101111,00100000,01101000,01100101,01110010,00100000,01110000,01100001,01110000,01100101,01110010,00111111,00001010,01001000,01100001,01110010,01110010,01111001];
BinToDec(n)=n=digits(n);d=0;for(i=1,#n,d+=d;if(n[i]==1,d++));return(d);
{v=vector(#CT);for(i=1,#CT,v[i]=BinToDec(CT[i]));
for(i=1,#v,print1(Strchr(v[i])));}Jodie
You may remember . . . what happened to her paper?
HarryChallenge 2:
Q2hhcHRlciAyOiBCdXQgQmFzZTY0IGNvZGluZyBpcyBub3QgYSBjaXBoZXIg- This reply was modified 1 day, 9 hours ago by english_lad.
- This reply was modified 4 hours, 34 minutes ago by Harry.
-
19th November 2026 at 5:41 pm #166585Puzzling_PelicanParticipant
@ByteInBits
It is very nice to see how others solved the challenges, especially for some of the later ones where there are multiples different ways of approaching the problems. The competition website has links to my model answers in Python that are designed to be readable but not necessarily optimised.As for your comment on Challenge 2, yes I agree. I had to make sure that the competition did not get too difficult too soon, however rest assured, Challenge 3 is actually encrypted and a step up in difficulty. Not sure how much 3 will challenge you just yet but I hope that by Challenge 5 you will be stretched, not to mention the truly evil challenge planned for 10.
For anyone else reading this, it is not too late to start. Next Monday is the final warn up challenge before the core competition starts.
You can find the link in this news post:Also, if you’re enjoying it and think your friends might too, please get them involved, it is fun and they can learn quite a lot.
See you all on the leaderboard!
Puzzling_Pelican
-
-
AuthorPosts
- You must be logged in to reply to this topic.