What will be the ciphered text corresponding to “ALGORITHM” if running key cipher is used for encryption with keyword as “DATASTRUCTURE”? a) LDJOZOBBK b) DLZOJBKBO c) ZOLDJBKBO d) OLZBJDKBO

make a code  used mathlab if possible  please dont uses if or return keep it basic

Please visit https://en.wikipedia.org/wiki/Caesar_cipher. You will be writing code that encrpyts and decrypts using this method. Specifically, you'll be writing functions: E,(1) (z+ n) mod 27 D„(1) (1- n) mod 27 On the Wiki page, the modulus (%) is 26, but we're using 27-why? We are adding an extra symbol { for space. Please visit https://en.wikipedia.org/wiki/ASCII. If you look at the printable ASCII characters, you'll notice that { (hex value 7A) follows z. Thus we can easily extend our cypher to include this symbol for space. Let's see how. 1 sentence "this is a secret message about the class" sentence sentence. replace (" ", "{") 3 print (_sentence) 4 es - 5 for i in sentence: es - encrypt (i, 5) 7 print (es) 6 8. 9 ds - 10 for i in es : 11 ds - decrypt(i, 5) 12 13 O_sentence ds. replace ("{", " ") 14 print (o_sentence) has output 1 this {is{a{secret{message{about {the{class 2 ymnxenxefexjhwjyerjxxfljefgtzyeymjchqfxx this is a secret message about the class In this cypher we are…

I need this answer quickly.

How do I make this java encryption and decryption show different letter and not use the same words in a word E.g. Message: Character Message encrypt: Hmfwfhyjw Message decryption: Character So the letter a are switched out with f. I would all letters to be unique and not be the same Same with r

Can you fix this code, I keep getting a synatax error. Its a simple python code that suppose to encrypt letters and create a secret code. I would also for the code to accept any word.    from random import shuffle       #for shufflefrom string import ascii_lowercase   #for lowercasea = [0]*26   #original indexfor i in range(26):   a[i] = ishuffle(a)   #shuffled indexarrayOfLetters = ascii_lowercase;   #lowercase lettersplain = raw_input('Enter String to encrypt: ')encrypt = ""   #encrypted stringfor i in range(len(plain)):   index = ord(plain[i])-97   print plain[i],index,a[index],arrayOfLetters[a[index]]   encrypt = encrypt + arrayOfLetters[a[index]]print encrypt

AO A B C D E F G H I J K L M 0 1 2 3 4 5 6 7 8 9 10 11 12 N 0 P Q R S T U V W X Y Z 13 14 15 16 17 18 19 20 21 22 23 24 25 (Show your work.) Encrypt the message "TYVQ" using Affine Cipher in English alphabet with a = 7; b =22 and encryption function is f(p) = (7p+22) mod 26 A) hens B) helo C) zine D) zict

CSE Python LAB: Question 2} You initially start with a binary string S0 which is of length N and has all 0s. You are then given U updates, which keep transforming the string. The i-th update transforms the string Si-1 into Si, and hence after all the U updates you will be left with SU. A single update is of the form (Li, Ri), which means that all the 1s in the range [Li, Ri] (both end points included) should be changed into 0s, and all the 0s in that range should be changed to 1s. You need to find out which among the U+1 binary strings: S0, S1, .., SU, is lexicographically the largest, and print that string. You have to develop a python program that output a single line containing one binary string Sample Input: 10 10 9 10 6 10 9 10 1 8 3 5 3 3 3 4 3 9 4 8 7 7 Sample Output: 1111100011

Python Write a function that will redact every third word in a sentence. Make use of the hashtag (#) symbol to redact the characters that make up the word, i.e. if the word is five characters long then a string of five hashtags should replace that word. However, this should not redact any of the following punctuation marks: apostrophes (')quotations (")full stops (.)commas (,)exclamations (!)  question marks (?)colons (:)semicolons (;) Arguments: sentence (string) →→\rightarrow sentence that needs to be redacted. Return: redacted sentence (string)→→\rightarrow every third word should be redacted. def redact_words(sentence): return

Using Python