Secret Codes on OML
10-24-2013, 08:33 AM
(This post was last modified: 10-24-2013 08:52 AM by TheGreatErenan.)
Post: #3
|
|||
|
|||
RE: Secret Codes on OML
The first word was "codes" actually. Also, strictly speaking, the first code is ASCII expressed in binary. Binary is not a code but simply a numeral system.
We should totally invent a secret code! Or maybe a simple encryption/decryption algorithm that we could perform by hand relatively easily. That might be fun, too. Actually, if PMs were working, then we could just send one-time pads to each other and no one would be able to decipher our messages without stealing our PMs. Anyway, I'll give an example encryption algorithm, if you're interested. Here is an encrypted message: Qgn ruzobfho, xuq sp bjoidscf htsi rtzhdnd. And here is the procedure: Encryption: For each word: 1. Rotate the letters to the left by two positions. (e.g. "example" becomes "ampleex") 2. Change each letter into the letter just before or after it, starting with before, and then alternating with each letter. Treat the alphabet as a cycle, so that "z" is considered before "a" and "a" is considered after "z". (e.g. "ampleex" becomes "znomdfw"). Decryption: For each word: 1. Change each letter into the letter just before or after it, starting with after, and then alternating with each letter. Treat the alphabet as a cycle, so that "z" is considered before "a" and "a" is considered after "z". (e.g. "znomdfw" becomes "ampleex"). 2. Rotate the letters to the right by two positions (e.g. "ampleex" becomes "example"). |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread:
25 Guest(s)
25 Guest(s)
Return to TopReturn to Content