Let's play the Decipher Game! Here's how it works:

1) Somebody posts a ciphered text (Invent your own cipher! Be creative!)
2) Everybody else attempts to decipher it.
3) Whoever posts the correctly deciphered plain-text and the deciphering method wins points and gets to be up next and post their own ciphered text
4) Lather, rinse, and repeat!

Oh, and the points don't matter Razz
AND you must be able to decipher your own ciphered text. No MD5-esque shenanigans.


Anywho, here's an easy one Wink

Code:
111300070004:0010001400080002000a:00010011000e0016000d:1105000e0017:00090014000c000f00040003:000e001500040011:001300070004:000b000000190018:1103000e00060012
Sound fun, I'l take a closer look after work, since I start in an hour from now. However, I bolded parts of 3 for clarity Smile
Do you guys want to each talk about ideas that you have as we go as far as solving the current cipher, or do you guys want to each work on it silently and individually? Because I have some ideas on this one. Also, I vote that all the ciphers be codable and decodable by hand, with at most a simple 4-function calculator at the worst.
TsukasaZX wrote:
AND you must be able to decipher your own ciphered text. No MD5-esque shenanigans.

I think what you mean here is that this a cipher contest, not a cryptographic hash breaking contest.
I think that's exactly what he means. Smile Getting some ideas on Tsukasa's ciphertext from staring at it...
I'm surprised Super Nerd Kerm didn't solve it in a single glance Laughing
I'm either underestimating my cipher or overestimating Super Nerd Kerm Razz
TsukasaZX wrote:
I'm surprised Super Nerd Kerm didn't solve it in a single glance 0x5
I'm either underestimating my cipher or overestimating Super Nerd Kerm Razz
I didn't bother testing my hypothesis about it that I voiced in IRC because I'm working on my research for school; I'll try it in a bit. Wink
*bump*

Separated into words:

Code:
111300070004
0010001400080002000a
00010011000e0016000d
1105000e0017
00090014000c000f00040003
000e001500040011
001300070004
000b000000190018
1103000e00060012
Words separated into groups of 4 hex digits:


Code:
1113 0007 0004
0010 0014 0008 0002 000a
0001 0011 000e 0016 000d
1105 000e 0017
0009 0014 000c 000f 0004 0003
000e 0015 0004 0011
0013 0007 0004
000b 0000 0019 0018
1103 000e 0006 0012
It appears
groups that start with 11 are special! Let's convert to decimal.

Code:
 1100 | 19) 7 4
16 20 8 2 10
(1100 | 5) 14 23
9 20 12 15 4 3
14 21 4 17
19 7 4
11 0 25 24
(1100 | 3) 14 6 18
Clearlu 1100 either means "new phrase" or "capitalize, and the rest are zero-indexed letters. Let's try that.

Code:
T h e
q u i c k
b r o w n
F o x
j u m p s
o v e r
t h e
l a z y
D o g
Very nice job, Tsukasa! Now I need to come up with one. Smile
Your decipher method is correct but your resulting plain-text has a couple of errors. It's "jumped" and "Dogs" but you win anyway Razz
TsukasaZX wrote:
Your decipher method is correct but your resulting plain-text has a couple of errors. It's "jumped" and "Dogs" but you win anyway Razz
Ah, thanks for pointing that out; I got lazy. Aight, here's my puzzle for you guys. It's a modified form of my personal cipher. I'll give you two ciphertexts that should be independently decoded. It's slightly harder than Tsukasa's first cipher.

Gsvhv ziv rmgvivhgrmt dliwh uli blf gl ivzw.

Htwiw ajw ipsuthpc xsvvwjwnh anv tmlwvgppc rgih ai waic.

Note that the method of translation of the second line is NOT identical to that of the first.
Slightly harder? I don't think so Razz

*ahem*
Quote:
Gsvhv ziv rmgvivhgrmt dliwh uli blf gl ivzw.

This one's your standard cipher and uses the reverse alphabet (a = z, b = y, etc). The deciphered text is:
Quote:
These are interesting words for you to read.


Quote:
Htwiw ajw ipsuthpc xsvvwjwnh anv tmlwvgppc rgih ai waic.

This one's a one-off of the standard reverse alphabet. In this case: a= a, b = z, c = y, etc. The deciphered text is:
Quote:
These are slightly different anf hopefully just as easy.

Kerm made a typo Razz

Did I win?
You win, and yes, I made a typo. Razz Who are you, Sonlen? Very Happy I want to see your new cipher!
New cipher? Here you go! It might be a bit of a doozy at first glance!
(note, I had to arbitrarily line-break them to make them not blow up Cemetech's width. These are continuous strings)

Quote:
1010101011171101a261n002020200s000f0000000011171100a100n
0172317001010100s000f011171101a261n019251901a261n01f311s
00s000f00101010111711006060600s000f10b110o01f311s01a261n
0010101011171100e140r01f311s00p020c00s000f01b271o01f311s
01a261n001010100e140r00c120p001010100s000f00101010111711
006060600s000f118241801a261n0010101011171100e140r01f311s
00p020c00s000f00a100n019251900d130q00s000f001010100a100n
016221600e140r00s000f001010101117110142014019251900e140r
00s000f10f150s00a100n0010101011171100e140r01f311s00s000f
001010101a261n00s000f006060600e140r00s000f01a261n0172317
00d130q00e140r00s000f00b110o00a100n0172317017231700s000f
010161000a100n018241800e140r00p010c


Err.... or you can go with an easier one Very Happy
Quote:
10c120p00a100n0000000001010100s000f0142014019251900s000f
0010101011171100e140r00s000f019251900a100n018241800e140r
00s000f01a261n00f150s00s000f110161001a261n00d130q00p020c
00s000f006060600e140r00s000f019251901a261n001010100s000f
01016100020202014201401723170010101006060600p010c


Good luck? Evil or Very Mad
Quote:
Thou shalt honor thy Brother, Protect thy Mother, and take thine Father to ye olde ball game.

Cast in the name of God, ye not guilty.

Nice touches with the casing indicator and the period-or-comma bit, but the redundancy in the two columns being rot13 reflections of each other still leaves me flummoxed. Furthermore, it seems you would have me believe that there are two letters in the English alphabet between "h" and "i". So, for that, I'm not going into the extra detail of how I solved it. Razz

ETA: Groups of seven.
Well, overall in your text, a letter count:


Code:
a  19
b   3
c   7
d   3
e  12
f  32

n  19
o   3
p   7
q   3
r  12
s  32
All other letters do not exist. Numbers:
Code:
0: 339
1: 224
2: 42
3: 14
4: 21
5: 8
6: 31
7: 21
8: 6
9: 12
I'm fascinated that abcdef exactly match nopqrs in letter frequency; I think that's pretty telling. Smile The shorter text has 278 characters. The long string of 00000 makes it likely the text either has a header or non-trivial encoded letter lengths. More later.
No wonder it wasn't making sense, I had 0060606 as 'e' instead of 'y'
1) Divide into groups of seven:

Code:
10c120p 00a100n 0000000 0010101 00s000f 0142014 0192519 00s000f 0010101 0111711 00e140r 00s000f 0192519 00a100n 0182418 00e140r 00s000f 01a261n 00f150s 00s000f 1101610 01a261n 00d130q 00p020c 00s000f 0060606 00e140r 00s000f 0192519 01a261n 0010101 00s000f 0101610 0020202 0142014 0172317 0010101 0060606 00p010c


2) Notice how the third and seventh character are always paired: a with n, b with o, c with p, d with q, e with r, f with s.

3) Notice how if you think of each septuple as XAAYYBC, that A and C are either the same number or equivalent characters (see (2) ) and that YY is the decimal equivalent of AA taken as two hex digits in two decimal digits.

4) That gives you a simple decimal value for each group, which apparently is not directly translatable to 0-25 == a-z, but I'm sure the remainder is a trivial exercise I will leave to the reader.

Code:
panpspanpsqsponpspanqspanqsnponqsponpspanqsponqsnpaqsponps
npoqsnponqspoqspanpsponpsponqsnpaqopanqsnpsponpsnponqsnpaq
opanqsnpanqsnpanqsponpspanqsponpspanpsponpspanqsponqspanps
nponqsnpaqopanqsponqspaqsnponqsnpaqopanqspaqsponpsponpspaq
snpanqsnpanqspsnponqsnponqspanqsnpsponpsnponqspoqspanpspon
pspsnponqsnpoqspanqspanqsnponqsnpanqopaqsnpanqsnponqspanqs
npoqsnponqsnponqsnpaqopanqsponqspaqsnponqspoqsnpoqspanqsps
npoqsnpanqsnpanqsnpoqsnpaqsnpoqspsnponqspanqsponqsnpaqspon
psnpoqsnponqsnpaqopanqsnpanqopaqspoqspanpsnpsnponqsnpaqopa
nqspoqsnpanqopaqsponqsqsnponqspanqsnpanqsnpanqsponpspanqsn
psnpaqsnpsponpsnpsnpaqspspoqsqsnpaqopanqsnpoqsqspspoqsqsnp
aqopanqsnpoqspanqspanpsnpaqopanqspaqsnpaqopanqsnponqsnpaqo
panqsnpaqspanqspanpsnpaqopanqsnpanqopaqsnpaqopanqspoqsnpaq
opanqsnponqsnpaqopanqsponpspoqspanqsnpaqopanqsqspanqspanps
npaqopanqsponpspoqsnpaqopanqsnpaqopanqsqspoqspanqsnpaqopan
qsnpaqopanqsnpaqopanqsnpsnpaqopanqsponpspoqspoqspanqsnponq

I hope you'll have as much fun solving this as I did constructing it.

It conceals the hint and the answer separately. Only hit Submit when you have both.
Hint(s): p and q are inputs, and that's the truth.
Weregoose wrote:
Hint(s): p and q are inputs, and that's the truth.
Ooooh, I think I see it! If it's what I think it is, very nice...
  
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.

» Go to Registration page
Page 1 of 2
» All times are UTC - 5 Hours
 
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum

 

Advertisement