a. Develop a Caesar cipher-type encryption algorithm with a little more complexity in it. For example, the algorithm could alternatively shift the cleartext letters positive and negative by the amount of the key value. Variations on this are limitless. b. Select a single-digit key. c. Code a short message using the algorithm and key. d. Give your instructor the algorithm, key, cleartext, and ciphertext. e. Optional: Your instructor will randomly redistribute to the class the ciphertext messages completed in part d above. You are to decode the message you receive as an additional assignment.

In this problem, you will implement a transposition cipher that, instead of dividing the original text into odd and even characters, separates it into three sets of characters. As an example, we will use this 1977 quote by Digital Equipment Corp. president Ken Olson -- "There is no reason anyone would want a computer in their home." (Spaces are represented with the square u-like character.) There is no reason anyone would want a computer in their home. Rail 1: T r S d i t i h a C. e Rail 2: e a u a u in h Rail 3: a W n. m m Example three-rail transposition. The resulting encrypted text is produced by reading the text horizontally, i.e., adding the three rails: Rail 1 + Rail 2 + Rail 3 = **“Trinrs yeoda cpeitihehesoeoao u naournhro.e annnwlwt mt e m" (without the quotes). Requirements: Implement the three-rail transposition cipher above, placing your code in the file p4_2.py (template I provided, replace comment at the beginning of the file with your own code). Feel free to develop your…

Alice's RSA public key is P First he assigns numbers to characters: A is 4, B is 5, period: 32, a coma: 33, an apostrophe: 34. Then he uses RSA to encode each number separately. (e,n) = (5, 1501). Bob sends Alice the message by encoding it as follows. Z is 29, a blank is 30, quotation marks: 31, a Bob's encoded message is: 578 961 1247 311 1370 1167 119 1247 311 1167 1412 311 1024 311 699 1310 271 1167 1247 55 1403 311 1247 848 1369 1320 1167 699 1167 55 1247 1370 1403 311 296 1247 950 1247 1412 296 1247 1412 55 311 1310 1412 311 699 271 1167 1247 1412 271 1247 311 1024 1412 296 311 55 1247 271 444 1412 1310 1370 1310 934 1403 1321 311 1167 1412 311 961 444 1167 271 444 311 444 1024 1381 296 1370 1403 311 1024 1412 1403 1310 1412 1247 311 466 1412 1310 961 699 311 1024 1412 1403 55 444 1167 1412 934 311 1024 123 1310 1320 55 311 699 271 1167 1247 1412 271 1247 311 1024 1412 296 311 55 1247 271 444 1412 1310 1370 1310 934 1403 1078 578 Decode Bob's message. Notice that you don't have…

Provide its algorithm

I don't understand what mathematically is happening in this code. Trying to determine theorem or strategy used with q = b / a then a = (a + q) / 2.