|visits||member for||1 year, 6 months|
|seen||Mar 25 at 16:49|
How to attack a general polyalphabetic cipher?
This is what i expected, however if you have n splits of the ciphertexts which were encrypted with a general monoalphabetic cipher, carrying standard frequency analysis on each section seems like a right pain as even when you got the correct key it would have to be tested with the original ciphertext. Is there no simpler solution? as if you had a key lengt of 17 say, that would be 17 random pieces of ciphertext to decrypt, how would you ever know you got the right answer? unless you got a majority of them right?
Example of CHI Square test on Caesar Cipher?
I was running a CHI test for each shift in the Ceaser cipher against a sample of the English language. Then i was looking for a peak which would suggest which shift was most likely used.