Question: please do in Python, thank you! [50 points] Vigenere cipher masks the frequency with which a character appears in a language: one letter in the
![please do in Python, thank you! [50 points] Vigenere cipher masks](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f2f2d376fec_90666f2f2d2dfd82.jpg)
please do in Python, thank you!
[50 points] Vigenere cipher masks the frequency with which a character appears in a language: one letter in the ciphertext corresponds to multiple letters in the plaintext. Write a program that breaks the following Vigenere cipher text: Mom zgldmpx aspjl, lpw tedspbxk uywgsk, xjv kewrepvy deszgj tvp usmfl, ls tvxkxc h zijmgra wh tskl, ql'k nzox e vltwalisp tlhsv fhlw ty xjv akrb vn i fjmgeh. This cipher text is encrypted with the following key: "thisisasecretkey": Treat letters as numbers such as A=0,B=1,C=2,,Z=25 and Zn={0,1,2,,n1}. Given m, a positive integer, P=C=(Z26)n, and K=(k1,k2,,km) a key, we define: Encryption: Ek(p1,p2,,pm)=(p1+k1,p2+k2,,pm+km)(mod26) Decryption: Dk(C1,C2,,Cm)=(c1k1,C2k2,,Cmkm)(mod26)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
