A game of encoding systems

[alexander]

.... ..- -- .- -. ... .... .- ...- . .- .-.. .-- .- -.-- ... .... .- -.. .. -. - . .-. . ... - .. -. --. .-- .- -.-- ... - --- -.-. --- -- -- ..- -. .. -.-. .- - . .- -. -.. .. - .... .. -. -.- - .... .- - --- ..- .-. ... -.-- ... - . -- ... ..-. --- .-. .--- ..- ... - ... ..- -.-. .... . ...- . -. - ... .... .- ...- . .- .-.. .-- .- -.-- ... -... . . -. --.- ..- .. - . ..- -. .. --.- ..- . .- -. -.. .. -. -. --- ...- .- - .. ...- .

- .- -.- . ..-. --- .-. . -..- .- -- .--. .-.. . -- --- .-. ... . -.-. --- -.. . -. --- - .... .. -. --. -... ..- - .- -... .. -. .- .-. -.-- ... .. --. -. .- .-.. -.-- . - .- ... .. --. -. .- .-.. - .... .- - .... .- ... .-. . ...- --- .-.. ..- - .. --- -. .. --.. . -.. .... --- .-- .-- . -.-. --- -. -. . -.-. - .- -. -.. -.-. --- -- -- ..- -. .. -.-. .- - . .. -. ..-. --- .-. -- .- - .. --- -.

... --- .... . .-. . .. .-- .- ... - .... .. -. -.- .. -. --. .- -... --- ..- - ... --- -- . - .... .. -. --. ..-. ..- -. - --- -.. --- .- -. -.. .. - .... .. -. -.- .. .... .- ...- . -.-. --- -- . ..- .--. .-- .. - .... ... --- -- . - .... .. -. --. - .... .- - -- --- .-. . - .... . -. .--- ..- ... - .. .-- .. .-.. .-.. . -. .--- --- -.-- .... --- .-- .- -... --- ..- - -.-. --- -- .. -. --. ..- .--. .-- .. - .... ...- .- .-. .. --- ..- ... . -. -.-. --- -.. .. -. --. --- .-. -.. . -.-. --- -.. .. -. --. ... -.-- ... - . -- ... --- ..-. -.-. --- -- -- ..- -. .. -.-. .- - .. -. --.

 

.... . .-. . .- .-. . - .... . .-. ..- .-.. . ... --- ..-. - .... . --. .- -- .

 

1) ... -.-- ... - . -- .... .- ... - --- -... . -.. . -.-. --- -.. . .- -... .-.. . .-- .. - .... --- ..- - .- ... . -.-. .-. . - -.- . -.-- ... --- -.-- --- ..- -.-. .- -. -. --- - .-. . .- .-.. .-.. -.-- -.. --- -.-. .-. -.-- .--. - ---

2) ... -.-- ... - . -- . -..- .- -- .--. .-.. . ... .... --- ..- .-.. -.. -... . .- .-.. . -. --. - .... -.-- .--. .. . -.-. . --- ..-. .-- .-. .. - .. -. --. ... --- -- . - .... .. -. --. - .... .- - ... .... --- ..- .-.. -.. --. .. ...- . .- ..-. .- .. .-. .- -- --- ..- -. - --- ..-. ..- ... . -.. .- - .- ... --- .. - -.-. --- ..- .-.. -.. .--. --- - . -. - .. .- .-.. .-.. -.-- -... . ... --- .-.. ...- . -.. .-.. .. -.- . .- -.-. .-. -.-- .--. - --- --.- ..- --- - .

3) .-.. .- ... - .-.. -.-- - --- -- .- -.- . .. - .- -... .. - -- --- .-. . ..-. ..- -. -.-- --- ..- .... .- ...- . - --- ... .. --. -. -.-- --- ..- .-. . -. -.-. --- -.. . -.. -- . ... ... .- --. . .-- .. - .... .- -.. . -.-. --- -.. .. -. --. --- ..-. - .... . .-- --- .-. -.. .... -.-- .--. --- --. .-. .- .--. .... -.--

 

( .... -.-- .--. --- --. .-. .- .--. .... -.-- => Hypography)

 

P.S. once you are done with this simple system, post the decoding, and alternately a different, or your own-made system for people to figure out. ( i guess the last part makes this easier to decode, but its a game, not a competition, and one can choose to not use the hint...)

[sanctus]

But from my memory that is just in morse-alphabet, because a=.- o=--- and this is exactly the symbols which appear where they should in hypography.

 

And it has been confirmed by a morse converter, so you cheated Alex and didn't come up with your own ;-)

[alexander]

oh but i used morse for a very good reason, one of which is because i was playing with a morse converter i wrote a while back, and secondly morse has a profound effect on the history of communication, so, yeah i didn't come up with anything special here, buut i certainly have some things i have done which i plan on playing with later... Also i never said that you can only post your own made system, and i figured it would be an easy place to get going...

[sanctus]

Ok, here is mine:

 

. ---- - - -. --- -- - --- . -. -.-- . - -.- -. . -- ... .- --.- -.- ... .. -. -.-- - .--. -. .- .-- - -.- --- .-.- ... .-- - -.. ... --. -.-- .-- .--- - . ---- -- --- ... .- - ...---

 

-.- - -..- -.-- -. .-.- - -..- - -.- -- ... .-- --- .--- .-.. ---- .-.. -..- ---- - .- --- -. .- .-- ---- .-.. -..- ---- - .- --- .--- .-.. -..- - -.- -- ... .--

 

.. .-.. --.- -.- -- - .- .-- - .. -. .-.- --- -- --- ---. - -.- .-.. ..- ... ... .-- -. . .-- ... -- .- ..- . ---- - --- - -.- - -..- -.-- -. .-.- - .. - .- . --- .-..-. -.. -- . ---- -. .- -- .- . - -.- .. - .-- -- -. . - --- . - -..- ... .--- ---. -- ... --. --- -.-- .-.. .-..-.

 

-. .- .-- . ... - .- .-- ---- - -.- - -- --- ...---

 

---- .-.. -..- ... ..- -.- -. -..- ---- .-.. =>hypography

[alexander]

soo morse code in reverse, eh, well its still morse code, really hyphens and dashes are only common representations of the signal, essentially that didn't change anything...

 

sanctus said:

 

the easiest alteration from alexanders codewould be this one

replace periods by hyphens and hyphens by period

my friend emacs is very good at doing these replacements with an intermediate step obviously

and to end here is

 

Ok, here is something a tiny bit more tough to do:

[noparse]1Q1E1F1Pv1P1E1x1I1Iv1y1Bv1xv1I1F1Q1Q1I1Bv[/noparse][noparse]1E1x1O1A1B1Ov1x1Pv1Q1E1F1Pv1x1z1Q1R1x1I1I1Vv1R1P1B1Pv[/noparse][noparse]1x1P1z1F1Fv1S1x1I1R1B1Pv1x1K1Av1z1L1K1S1B1O1Q1Pv[/noparse][noparse]1Q1E1B1Jv1Q1Lv1xv1O1x1Q1E1B1Ov1T1B1F1O1Av1y1x1P1B[/noparse]
[noparse]1E1L1T1B1S1B1Ov1Q1E1F1Pv1F1Pv1xv1z1L1K1P1F1P1Q1B1K1Qv[/noparse][noparse]1B1K1z1L1A1F1K1Dv1P1R1z1Ev1Q1E1x1Qv1L1K1Bv1z1x1Kv1P1L1I1S1Bv[/noparse][noparse]1F1Qv1T1F1Q1Ev1P1F1J1M1I1Bv[/noparse][noparse]1P1R1y1P1Q1F1Q1R1Q1F1L1Kv1Q1B1z1E1K1F1N1R1B[/noparse]
1P1E1L1R1I1Av1y1Bv1B1x1P1Vv1B1K1L1R1D1Ev1Q1Lv1C1F1D1R1O1Bv1L1R1Qv1y1R1Qv1z1x1Kv1V1L1Rv1D1R1B1P1Pv1E1L1Tv1F1Qv1F1Pv1D1B1K1B1O1x1Q1B1

1E1V1M1L1D1O1x1M1E1V => hypography

[sanctus]

Don't remember how to code this (was never good in char coding), but to transform all takes too long, the first 3 words are:

 

This shall be...

 

I will come up with a new one when I have som more time.

[alexander]

luckily you can just solve it as a cryptoquote, like i said above... if you are reading but not posting, or don't recall how to solve a cryptoquotes, here is a quick run-down:

 

1E 1V 1M 1L 1D 1O 1x 1M 1E 1V => hypography

1E - h

1V - y

1M - p

1L - o

1D - g

1O - r

1x - a

 

1P1E1L1R1I1Av1y1Bv1B1x1P1Vv1B1K1L1R1D1Ev1Q1Lv1C1F1D1R1O1Bv1L1R1Qv1y1R1Qv1z1x1Kv1V1L1Rv1D1R1B1P1Pv1E1L1Tv1F1Qv1F1Pv1D1B1K1B1O1x1Q1B1

 

guessing from the locations and seeming out-of-placement of "v" i suggest that they are spaces

 

there is also a typo, last character doesnt fit... oh well drop it for now

 

initial:

 

1P1E1L1R1I1A

1y1B

1B1x1P1V

1B1K1L1R1D1E

1Q1Lv1C1F1D1R1O1B

1L1R1Q

1y1R1Q

1z1x1K

1V1L1R

1D1R1B1P1P

1E1L1T

1F1Q

1F1P

1D1B1K1B1O1x1Q1B1

 

 

1E - h

1V - y

1M - p

1L - o

1D - g

1O - r

1x - a

 

 

1P h o 1R 1I 1A

1y 1B

1B a 1P y

1B 1K o 1R g h

1Q o

1C 1F g 1R 1O 1B

o 1R 1Q

1y 1R 1Q

1z a 1K

y o 1R

g 1R 1B 1P 1P

1E o 1T

1F 1Q

1F 1P

g 1B 1K 1B r a 1Q 1B

 

first words

y o 1R

 

1R - u

 

second round:

 

1P h o u 1I 1A

1y 1B

1B a 1P y

1B 1K o u g h

1Q o

1C 1F g u 1O 1B

o u 1Q

1y u 1Q

1z a 1K

y o u

g u 1B 1P 1P

h o 1T

1F 1Q

1F 1P

g 1B 1K 1B r a 1Q 1B

 

guessing from 1Q o and ou 1Q, i would guess that 1Q is a t

 

third round:

 

1P h o u 1I 1A

1y 1B

1B a 1P y

1B 1K o u g h

t o

1C 1F g u 1O 1B

o u t

1y u t

1z a 1K

y o u

g u 1B 1P 1P

h o 1T

1F t

1F 1P

g 1B 1K 1B r a t 1B

 

1F t looks like an it

1y u t looks like but

and in 1P hou, i think the only other letter coupled with h like that is an s

 

forth round:

s h o u 1I 1A

b 1B

1B a s y

1B 1K o u g h

t o

1C i g u 1O 1B

o u t

b u t

1z a 1K

y o u

g u 1B s s

h o 1T

i t

i s

g 1B 1K 1B r a t 1B

 

b 1B and 1B asy suggest that 1B is an e

the only other ho_ word i know is how, so 1T is a w

 

fifth round:

s h o u 1I 1A

b e

e a s y

e 1K o u g h

t o

1C i g u 1O e

o u t

b u t

1z a 1K

y o u

g u e s s

h o w

i t

i s

g e 1K e r a t e

 

so

1K is an N

 

and from context the final deconding, with correction of a lost syllable there, the translation of the last line is

 

should be easy enough to figure out but can you guess how it is generated

 

ok after yours sanctus, i will have a slightly more tricky one, well depending on what you post...

 

if you were wondering how the quote was generated, it is ascii values converted to base 62

[JMJones0424]

This is a derivation of a method I picked up some time ago.

 

As far as I know, the following method for encoding a message has never been successfully broken by an adversary. However, it's use requires pre-arranged passkeys and a significant amount of practice to use without leaving behind "scratch paper" evidence that may be used to determine the method of encryption. While being very efficient at concealing information, it is also very inefficient at conveying information, so its uses are limited. I will provide both the encrypted data and the means by which it was encrypted in 10-14 days if no one has yet figured it out. As a hint, the passkey is freedom.

 

[begin encoded message]

 

The key requirement in making useful, hard to break, cryptographic measures often is concealing the existence of data being encoded. Many ways for accomplishing this have cropped up through the years, but recently innovative means of concealment have been developed. Quite possibly the most unique approach is to use digital photography. Many subtle changes can be neatly hidden inside a digital photo that go entirely unnoticed to the human eye. Any common algorithm may be used to thus encode data into the picture, and if there is no reason to suspect the existance of any code, then the possibility of an adversary recovering the encrypted data is nearly zero.

 

[/End encoded message]

 

Enjoy!

[alexander]

JMJones, you didnt read the morse above, there is a rule about the kind of fun methods being played in this thread, the message with everything needed to decipher it should be within the message. I mean i can post the results of an AES256 crypto here and a private key, but it won't be true to what the thread is about... Unless it is solvable without a pass key, for example, shown above is how to solve a couple of substitution methods, but yeah i think it would be more fun to play with fully self-contained systems for communication encoding, which is different from encrypting with a key... I mean we can bring in the enigma cypher, or the numeric word from book cypher, but both require a shared key and they get very complex to solve even with a key, but point is to have a fully self-contained message where the way it is enciphered is the key... also to post solutions of how to decipher or how to approach deciphering the message.

[JMJones0424]

Point taken, the method to encypher is as follows:

 

1.Create a 5x5 grid. Enter in the passkey with no duplicate letters, followed by the rest of the English alphabet omitting duplicates(C & K are treated as the same letter, C)

 

So, for the passkey "freedom," the grid would be:

F R E D O

M A B C G

H I J L N

P Q S T U

V W X Y Z

 

2. In the message text, the first word is "The," which has three letters. So count from the first word of the message three words, which brings you to "requirement in."

 

3. In the above grid, R (first letter of requirement) is in column 2, and I (first letter of in) is in row 3. The letter at column 2 and row 3 is I, so the first letter of the encrypted data is I.

 

4. "in" has two letters, so count two words after "in" to find "useful hard," giving grid coordinates of 5,3 which is the second letter of the encrypted data, N. "Hard" has 4 letters, so count four words to the next pair of words, "measures often".

 

5. Continue this process until you see gibberish.

[alexander]

I think one of the more brilliant ways to cypher information was created for the top secret MIS-X project in WW2, and involved hiding information in letters, but in such a way that nobody reading the letter even with intent of finding a code would even remotely suspect that there was something hidden in the message...