Permutation ciphers, Permutation Ciphers (a.k.a.

Permutation ciphers

Assignment Help Python Programming

Reference no: EM13163656

Permutation Ciphers (a.k.a. Transposition Ciphers) are another class of simple cryptosystems. For this we use the functions apply(.,.) and inv(.) from Homework 4; copy these two functions into your le as auxiliary functions.
(1.a) De ne a function encr(k,m), where the message m is any string over the characters a...zA...Z, and where the key k is a permutation. When len(m) is not a multiple of len(k) we append (a minimum number of) Z's to m to make len(m) a multiple of len(k). In the encryption, m is subdivided into successive chunks of length len(k), and the permutation k is applied to each chunk. The number of chunks is ceil(len(m)/len(k)).
(1.b) De ne a decryption function decr(k,c), which inverts the encryption. Here, c is any string over the characters a...zA...Z, such that len(c) is a multiple of len(k).
(1.c) As comments, answer the following:
Give the encryption of the following text, with key [3, 2, 4, 1, 0] :
'SineLaboreNihil'
Decrypt the following cipher with the key [6, 1, 0, 2, 7, 4, 5, 3]:
EAGLSIALDOTMIISNPIVSAINAATREMUNM

Reference no: EM13163656

Questions Cloud

Same directory as your program : In the same directory as your program, create a file FF1, and write into it Hello (with a space at teh end). Similarly, create a file FF2, and write into it world! (with a new line, i.e., an ENTER at the end). And create a file DD and write into i..

Multiple choice question on networking : 1-Which of the following extensions point to an executable string of code?

Write a function trans(m) which returns the transpose : Write a function trans(M) which returns the transpose of an n-by-n matrix M. The matrix M is represented by a list of n lists, each of length n. Transposing M means that each M[i][j] is swapped (once!) with M[j][i].

True or false about networking : 2- A print queue must be set up for every printer on the network served by a print server. True False

Permutation ciphers : Permutation Ciphers (a.k.a. Transposition Ciphers) are another class of simple cryptosystems. For this we use the functions apply(.,.) and inv(.) from Homework 4; copy these two functions into your le as auxiliary functions.

Function should return a dictionary : Write a function numOccur(s), where s is a string; the function should return a dictionary whose keys are the 26 ascii letters abcdefghijklmnopqrstuvwxyz

Recursion to write a python function : Use recursion to write a Python function depth(LL), where LL is a nested list of lists of lists etc. of numbers (i.e., oat and int) and strings. We want to return the depth of nesting, i.e., how often, maximally, there is a list in a list etc

Determine the values for m and l for the b+ tree : A B+-tree is to be stored on disk whose block size is 2048 bytes. The data records to be stored are 50 bytes, and their key is 4 bytes. Determine the values for M and L for the B+-tree. Assume pointers are 4 bytes each.

Let ll be a list of integers : Let LL be a list of integers. Use list comprehension to produce teh following lists. Each one should just take onel line. Anser questions as two comments.

User Account

All Pages