20 Questions

I gotta give the win to ZoomZoomH...congrats man....did you decipher my super hard code(cough cough) or am I just that transparent?

Regardless, it's your turn...don't make it too insanely difficult.
 
alright, my turn

riddle me this:

01001101 01001001 01000001 01010100 01000001


HINT: these are NOT decimal numbers...

my fellow computer geeks should solve this in no time :D
 
Last edited:
Hmm the deciphering is the easy part for me...but i'm missing something....I'll hand it off to you MSG:

Numbers are from left to right:
77 73 65 84 65
 
LOL... You guys kill me. :)

Okay here's one that unix geeks ought to pick up on the spot..

JNLBSSGBCVP

In cryptography, I used what is called a monoalphabetic substitution cypher. Each letter of the alphabet is substitued with another one.

Here's the perl command line that produced it (slightly obfuscated to make it more difficult to understand. Hint: computers don't like base 10 numbers).
PHP:
perl -p -e 'y/\\101-\\132\\141-\\172/\\116-\\132\\101-\\115\\156-\\172\\141-\\155/'
 
enry said:
LOL... You guys kill me. :)

Okay here's one that unix geeks ought to pick up on the spot..

JNLBSSGBCVP

In cryptography, I used what is called a monoalphabetic substitution cypher. Each letter of the alphabet is substitued with another one.

Here's the perl command line that produced it (slightly obfuscated to make it more difficult to understand. Hint: computers don't like base 10 numbers).
PHP:
perl -p -e 'y/\\101-\\132\\141-\\172/\\116-\\132\\101-\\115\\156-\\172\\141-\\155/'

so:

y/A-Za-z/N-ZA-Mn-zam/

therefore:

JNLBSSGBCVP
||
WAYOFFTOPIC

:D

whew! what a nice review in regular expression!! :D

V NZ TBBQ :D
 
Last edited:
Time to raise the bar.
I am now going to use a Caesar cipher. It's the first documented cipher in all history!
Encryption is done using Ek: i -> i + k (mod 26)
Decryption is done using Dk: i -> i - k (mod 26)

WJTVHDZQZMODMZYDVHBJDIBOJWZY

Here's some perl code to help write an <b>exhaustive key search</b> program, but some key parts are missing, to make it more challenging.

PHP:
tr/a-z/A-Z/; for ($i=1;$i<=25;$i++){ $s=$_;print "k=$i -> ";eval("\$s=~tr/A-Z/".chr(65+$i)."-ZA-".chr(64+$i)."/;");print $s;} }

Of course you could just try all 26 ciphers till you get the right one.
 
Yeah...here is a riddle from my days down at NASA:

This was the encryption diagnostic cipher municipal Quadra-sink code we used to time the fuel management Electra-coil system for the booster rockets.

Begin sequence....

94847473872U8472348.329487////////23R98723498"38942A703:::::9N4820346_+_873492E8.0101010101>8376R92<(*#$&((##*#*#*000000101.978D9434

....End of sequence...

Yeah its all quite elementary if you ask me...feel free to decipher it. Let me know if you see the hidden message?
 
aaak!!!! :eek:

when did the admins become cryptographers??? :eek:

too much! too much!

( I would've linked the 'exploding content monkey' icon here, but don't know how, so :p )
 
This is elementary cryptography, I am still in monoalphabetic substitution cyphers.. It's really a trivial joke.
Once you get to polyalphabetic substitution cyphers you can theorize "unbreakable" ciphers because you using an algorithm which requires an extra piece of information to encrypt and decrypt, the key. But then the question is.. how do you transmit the key without it getting intercepted!

Who knows a modern (and wide-spread) solution to that problem?
 
People...their actually is a message in the code I posted...can anyone see it?

Please post the message if you can see it...thanks.
 
Antoine,


I worked with you in NASA. You and I came up with this encryption code. The only persen that will be able to break the code is on a secret mission in Moscow. No one else will be able to break it.
 
You win a chance to answer my question 5 posts up.

And by the way, Antoine/Todd, I have neutralised your agent in Moscow. Now I have all his information. Muhahahaha.
 
Back