Thanks! Id completely missed the new lines. Pretty sure that'll be it. If not its a massive coincidence.
Round two turned out to be pretty simple. Just base64 and a substitution cipher.
If round three involves md5's if ever we are in the same city I owe you a pint!
Payne
Search found 20 matches
- Wed Dec 12, 2012 6:47 pm
- Forum: General
- Topic: A code in need of breaking
- Replies: 2
- Views: 18289
- Tue Dec 11, 2012 11:15 pm
- Forum: General
- Topic: A code in need of breaking
- Replies: 2
- Views: 18289
A code in need of breaking
I am taking part in a national cipher competition. Round two is timed and tomorrow so getting some practice in. Probably far simpler than im making it out to be but im struggling with the 2011 round three code. MjUxMUZDNkNCMEJCMjQzMUMwQjQzRDY3OTNEMENCQzENCjYyQ0MwQjRFQkIwQjU3QjQwNzc4MTc5MjM0MjQ2QzM4D...
- Tue Mar 27, 2012 3:32 pm
- Forum: Challenges
- Topic: A Hundred 0s
- Replies: 33
- Views: 63984
- Tue Mar 27, 2012 2:56 pm
- Forum: Challenges
- Topic: A Hundred 0s
- Replies: 33
- Views: 63984
Its typical. Although it took three separate sites it was fairly easy to get the first few characters. But the important characters arnt so easy. Would make perfect sense if it was a particular corporate headquaters, or the word from which they come. Yet neither are accepted. Think the challenge nee...
- Tue Mar 27, 2012 12:22 am
- Forum: Challenges Solved
- Topic: Affirmative
- Replies: 15
- Views: 1620
- Mon Mar 26, 2012 7:31 pm
- Forum: Challenges
- Topic: A Hundred 0s
- Replies: 33
- Views: 63984
- Wed Mar 21, 2012 2:03 pm
- Forum: Challenges
- Topic: 'Mod' Challenge
- Replies: 19
- Views: 22538
Mod/Fast Mod
Well, after struggling with Mod and the 10000 cycle limit i then realized the obvious easy solution.
Kind of made Fast Mod a case of copy paste.
Kind of made Fast Mod a case of copy paste.
- Mon Feb 27, 2012 12:55 am
- Forum: Challenges
- Topic: Breakout / Breakout Extreme
- Replies: 24
- Views: 44578
- Fri Dec 09, 2011 8:21 am
- Forum: Challenges
- Topic: Affirmative - Crypto-Challenge
- Replies: 7
- Views: 12624
cant solve
so i get the yes code.
I presumed since it is divisible by 8 each line is binary using capitols. But i get nonsense.
A hint would be much appreciated.
Thanks
Payne
I presumed since it is divisible by 8 each line is binary using capitols. But i get nonsense.
A hint would be much appreciated.
Thanks
Payne
- Wed Dec 07, 2011 7:16 pm
- Forum: Challenges
- Topic: Random Problem Challenge
- Replies: 8
- Views: 16193
Struggling
Guessing there is some trick to this? Fairly sure i have run it for everything in the range -2147483647 to 2147483647 without an error
[Edit] -Scratch That. Was Being Retarded. Can't believe i spent over an hour on something so easy and obvious!!
[Edit] -Scratch That. Was Being Retarded. Can't believe i spent over an hour on something so easy and obvious!!
- Wed Nov 30, 2011 1:56 am
- Forum: Challenges
- Topic: Once upon a time
- Replies: 24
- Views: 36236
Took me ages!
i was being too clever with the url
- Sat Aug 06, 2011 3:42 pm
- Forum: Challenges
- Topic: Didactic Text 3
- Replies: 39
- Views: 54606
- Sat Jul 16, 2011 10:06 pm
- Forum: Challenges
- Topic: CipherQuest B
- Replies: 7
- Views: 11766
Hardest yet By Far
So, I have been going at this for ages. Theres a set of 7 letters that i extracted and noticed some strong patterns with them that could suggest they have a much more complex meaning that in previous challenges. Or it could just be coincidence. Mayb its not a simple mono substitution? Any hints real...
- Sat Jul 16, 2011 3:11 pm
- Forum: Challenges
- Topic: Didactic Text 4
- Replies: 20
- Views: 43778
Clueless
Well i noticed the differences. Converted to binary all of the in question words. Binary converter gets nothing. Is it only the changed words mayb? not the originals from the same pattern, any hints would be nice.
- Sun Jul 10, 2011 4:42 pm
- Forum: Challenges
- Topic: Didactic Text Combo
- Replies: 16
- Views: 24737
Hints
Any Hints? i have the letters posted above. Using a few tools im pretty certain its not a substitution/. Judging by what it says maybe someone could suggest which previous challenges i should look at to help me with this?