Question: 3 . ) [ Worth 3 0 points ] The following is some text from my notes: Looking for repeating substrings can be tedious, and

3.)[Worth 30 points] The following is some text from my notes:
Looking for repeating substrings can be tedious, and if the cipher is monoalphabetic, then the Kasiski test doesn't help us any. How can we tell from the start whether or not one or more alphabets are being used?
- By the number of letters in the string.
The idea here is that the frequency table of an MSC should look like the one for standard English, just with the letters matching different frequencies. The way we go about measuring this is a little different from this, but it gets at the same thing. We use the Index of Coincidence.
The following is that same text encrypted in three different ways. You are told that one is the result of an affine encryption, and that the other two used Vigenre ciphers, whose keywords were length 4 and 8. Analyze the three ciphertexts, and explain how you know which is which, using the IC. Make sure you describe what you did along the way.
a.)
rsoborgwuvrvviakorgjafskxmnxygaehitvjmolyenuojtykgignirzyqoeuelgnebvzmckninknikrymsboxejzhovyrtykpplyenpnswtgrwvzilclvodzlejzerkcleknirfxrokurefxqoikelgnebvzwaikfeztkujkhtykmdvgleikmsknetknifikuuvtgykgflvujaeswcjnsucjpofqpibkxhvurewuvskgrdrxheempijnnujzaiknxhvritkkvsdgxcyorguojfvxinklvehaintoiskniwreaerixurrpyxuebfaxmvgwuiorgknmszyelzzxlvjmfwkveezjrfsxhzyfukoxgvzwakzlejgqeknmnxciujkxhvordvdsftumntoheeii
b.)
svvrpunmvyylwlhapunzbizaypunzjhuilalkpvbzhukpmaoljpwolypztvuvhswohilapjaoluaolrhzpzrpalzakvlzuaolswbzhufovdjhudlalssmyvtaolzahyadolaolyvyuvavulvytvylhswohilazhylilpunbzlkaolpklholylpzaohaaolmylxblujfahislvmhutzjzovbsksvvrsprlaolvulmvyzahukhyklunspzoqbzadpaoaolslaalyzthajopunkpmmlyluamylxblujplzaoldhfdlhjabhssfnvhivbatlhzbypunaopzpzhspaaslkpmmlyluamyvtaopzibapanlazhaaolzhtlaopundlbzlaolpuklevmjvpujpklujl
c.)
ncazcgkwqfdtjxekkbshouwktwzvmveedsftxbsluozscyxygquebxvzuaacitpgjontnbgkjszibxoruwezcmijvratmgxygzbjmtrpjcirugavvsxazksdvvqhntvkyvqibxvftbaiigiftaagytpgjontnleigpqxhzyjgrfwybhvcvqgybwkjofibxjigegthvckcpxtiyeeogohbhycfzadeembghttigiwqfeiughrtrqcaemjjxghnpmkjhttfxxkgfebumgykbsscyjvtszizkihwszrcxwkjsipspirehgpfecxqondomqvcgggcgkkjwexmtpzvhxtxbjwgfqcnyvfohtxmuykkhstnlekvvqhufikjwzvqxyjghttcghvzcrribrtkrqcwx

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!