Welcome Guest [Log In] [Register]
Viewing Single Post From: Substitution Revisited!
Paarth Dave
Advanced Member
[ *  *  * ]
Hey Guys,
I have got a new idea relating to substitution ciphers. I was trying to make substitution deciphering a little harder and I stumbled upon this new idea:

Code:
 

Let's take a random plaintext:

FLEE AT ONCE, WE ARE DISCOVERED

Now let's reverse the order of each word...
FLEE -> EELF
AT -> TA
ONCE -> ECNO
WE -> EW
ARE -> ERA
DISCOVERED -> DEREVOCSID

So the modified plaintext is as follows:

EELF TA ECNO EW ERA DEREVOCSID

Now let's substitute it with random alphabets...

So the ciphertext becomes:

NNGT XF NYAK NC NUF PNUNZKIMQP

Now again arraging the ciphertext from right to left:

PNUNZKIMQP NUF NC NYAK XF NNGT




I think this will make substitution ciphers much more stronger.

I will be not surprised if someone else might have come up with this concept before me.

Cryptography Vanquished....
Offline Profile Quote Post
Substitution Revisited! · General