use the text and code : cipher.txtxun gmr jznqymxu qzhhxzupmur ytmq dnvhq vavpncd vlvhpq mq txl xh mb ytnanhncxud lmii vpphnqq cnyxx nqenamviid vbynh ytn rxipnu rixgnq ltmat gnavcnv ozgmivuy axcmurxzy evhyd bxh ymcnq ze ytn cxfncnuy qenvhtnvpnp gd exlnhbzi txiidlxxp lxcnu ltx tnienp hvmqn cmiimxuq xb pxiivhq yx bmrty qnkzvitvhvqqcnuy vhxzup ytn axzuyhd python code :#!/usr/bin/env python3from collections import Counterimport reTOP_K = 20N_GRAM = 3# Generate all the n-grams for value ndef ngrams(n, text): for i in range(len(text) -n + 1): # Ignore n-grams containing white space if not re.search(r'\s', text[i:i+n]): yield text[i:i+n]# Read the data from the ciphertextwith open('ciphertext.txt') as f: text = f.read()# Count, sort, and print out the n-gramsfor N in range(N_GRAM): print("-------------------------------------") print("{}-gram (top {}):".format(N+1, TOP_K)) counts = Counter(ngrams(N+1, text)) # Count sorted_counts = counts.most_common(TOP_K) # Sort for ngram, count in sorted_counts: print("{}: {}".format(ngram, count)) # Print 1. use the frequency analysis to figure out the encryption key and the originalplaintext.using the python code provided and the cipherUsing the frequency analysis, you can find out the plaintext.It is better to use capital letters for plaintext, so for the same letter, to knowwhich is plaintext and which is ciphertext. use the tr command to do this.For example, letters m, t, and y in in.txt with letters B, P, S, respectively; the resultsare saved in out.txt.$ tr 'mty' 'BPS' out.txtcipher.txtxun gmr jznaymxu gzhhxzupmur ytmq dnvhq vavpncd vlvhpq mq txl xh mbytnanhncxud Imii vpphngg cnyxx ngenamviid vbynh ytn rxipnu rixgnq ltmat gnavcnv ozgmivuy axcmurxzy evhyd bxh ymcng ze ytn cxfncnuy genvhtnvpnp gdexlnhbzi txiidlxxp Ixcnu Itx tnienp hvman cmiimxuq xb pxiivhg yx bmrty gnkzvitvhvqgcnuy vhxzup ytn axzuyhdpython code:#!/usr/bin/env python3from collections import Counterimport reTOP_K = 20N_GRAM = 3# Generate all the n-grams for value ndef ngrams (n, text):for i in range (len(text) -n + 1):# Ignore n-grams containing white spaceif not re.search(r'\s', text[i:i+n]):yield text[i:i+n]# Read the data from the ciphertextwith open('ciphertext.txt') as f:text = f.read()# Count, sort, and print out the n-gramsfor N in range(N_GRAM):print("----")print("{}-gram (top {}):".format(N+1, TOP_K))counts = Counter (ngrams(N+1, text))sorted_counts = counts.most_common(TOP_K) # Sortfor ngram, count in sorted_counts:print("{}: {}".format(ngram, count)) # Print# Count

Python which refers to the one it is a high-level, general-purpose programming language. Its design…

use the text and code : cipher.txt xun gmr jznqymxu qzhhxzupmur ytmq dnvhq vavpncd vlvhpq mq txl xh mb ytn anhncxud lmii vpphnqq cnyxx nqenamviid vbynh ytn rxipnu rixgnq ltmat gnavcn v ozgmivuy axcmurxzy evhyd bxh ymcnq ze ytn cxfncnuy qenvhtnvpnp gd exlnhbzi txiidlxxp lxcnu ltx tnienp hvmqn cmiimxuq xb pxiivhq yx bmrty qnkzvi tvhvqqcnuy vhxzup ytn axzuyhd python code : #!/usr/bin/env python3 from collections import Counter import re TOP_K = 20 N_GRAM = 3 # Generate all the n-grams for value n def ngrams(n, text): for i in range(len(text) -n + 1): # Ignore n-grams containing white space if not re.search(r'\s', text[i:i+n]): yield text[i:i+n] # Read the data from the ciphertext with open('ciphertext.txt') as f: text = f.read() # Count, sort, and print out the n-grams for N in range(N_GRAM): print("-------------------------------------") print("{}-gram (top {}):".format(N+1, TOP_K)) counts = Counter(ngrams(N+1, text)) # Count sorted_counts = counts.most_common(TOP_K) # Sort for ngram, count in sorted_counts: print("{}: {}".format(ngram, count)) # Print

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

use the text and code :

cipher.txt

xun gmr jznqymxu qzhhxzupmur ytmq dnvhq vavpncd vlvhpq mq txl xh mb ytn

anhncxud lmii vpphnqq cnyxx nqenamviid vbynh ytn rxipnu rixgnq ltmat gnavcn

v ozgmivuy axcmurxzy evhyd bxh ymcnq ze ytn cxfncnuy qenvhtnvpnp gd

exlnhbzi txiidlxxp lxcnu ltx tnienp hvmqn cmiimxuq xb pxiivhq yx bmrty qnkzvi

tvhvqqcnuy vhxzup ytn axzuyhd

python code :

#!/usr/bin/env python3

from collections import Counter

import re

TOP_K = 20

N_GRAM = 3

# Generate all the n-grams for value n

def ngrams(n, text):

for i in range(len(text) -n + 1):

# Ignore n-grams containing white space

if not re.search(r'\s', text[i:i+n]):

yield text[i:i+n]

# Read the data from the ciphertext

with open('ciphertext.txt') as f:

text = f.read()

# Count, sort, and print out the n-grams

for N in range(N_GRAM):

print("-------------------------------------")

print("{}-gram (top {}):".format(N+1, TOP_K))

counts = Counter(ngrams(N+1, text)) # Count

sorted_counts = counts.most_common(TOP_K) # Sort

for ngram, count in sorted_counts:

print("{}: {}".format(ngram, count)) # Print

1. use the frequency analysis to figure out the encryption key and the original
plaintext.
using the python code provided and the cipher
Using the frequency analysis, you can find out the plaintext.
It is better to use capital letters for plaintext, so for the same letter, to know
which is plaintext and which is ciphertext. use the tr command to do this.
For example, letters m, t, and y in in.txt with letters B, P, S, respectively; the results
are saved in out.txt.
$ tr 'mty' 'BPS' <in.txt > out.txt
cipher.txt
xun gmr jznaymxu gzhhxzupmur ytmq dnvhq vavpncd vlvhpq mq txl xh mbytn
anhncxud Imii vpphngg cnyxx ngenamviid vbynh ytn rxipnu rixgnq ltmat gnavcn
v ozgmivuy axcmurxzy evhyd bxh ymcng ze ytn cxfncnuy genvhtnvpnp gd
exlnhbzi txiidlxxp Ixcnu Itx tnienp hvman cmiimxuq xb pxiivhg yx bmrty gnkzvi
tvhvqgcnuy vhxzup ytn axzuyhd
python code:
#!/usr/bin/env python3
from collections import Counter
import re
TOP_K = 20
N_GRAM = 3
# Generate all the n-grams for value n
def ngrams (n, text):
for i in range (len(text) -n + 1):
# Ignore n-grams containing white space
if not re.search(r'\s', text[i:i+n]):
yield text[i:i+n]
# Read the data from the ciphertext
with open('ciphertext.txt') as f:
text = f.read()
# Count, sort, and print out the n-grams
for N in range(N_GRAM):
print("--
--")
print("{}-gram (top {}):".format(N+1, TOP_K))
counts = Counter (ngrams(N+1, text))
sorted_counts = counts.most_common(TOP_K) # Sort
for ngram, count in sorted_counts:
print("{}: {}".format(ngram, count)) # Print
# Count

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.