But since there is a definate pattern here (something is getting replaced or subsituted by something) it always is easy to crack to Substitution or Caesar Cipher. So it won't matter much no matter how long strings you use since there will always be a simple formula which the hacker will look for.
Chossing some tougher 64 bit or 128 bit algos which are commonly used nowadays would be a much better choice. Some of them are RSA (Rivest Shamir Adelman) , MD5 Hash algorithms etc.
choose the replacement for first character from first string,
for second from second string,
for third from third string, like this, say 10 times.
then again we will use first string, then second, and so on...
> choose the replacement for first character from first string,
> for second from second string,
So you're saying that if you have 4 strings as your key
that taking 't' 's' 'r' 'd' .... and the other 12 letters in some order, that the result is a lot more secure than using "thisismywordgrid" as the key?
Yeah, maybe it will fool a dictionary based attack, but it certainly doesn't fix any of the frequency analysis attacks (a problem faced by a lot of substitution cyphers). A good algorithm has to stand up to all known attack forms, not just those that can be done with pen and paper.
substitution ciphers r really easy to decrypt be it in any complex form....
the best method is either using RSA ....
or any of the public key encryption methods (depending on the complexity of the host information, and how secure u want it to be)