Answered: 1.Suppose Alice sent the following…

1.Suppose Alice sent the following secret message: 001000000100100100111001001010000011101000111010 The decryption key was discovered to be: 01101001 Decrypt the message into plain text..

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter2: Problem Solving Using C++using

Section2.3: Data Types

Problem 5E

See similar textbooks

Similar questions

Please, solve this problem in Java code. Problem 1.Write computer programs for the Substitution Cipher based on Z29 which is corresponding to 26 alphabetic characters (0 - 25), space (26), and “, ” (27) “.”(28).The key is a random permutation π on Z29. Write down encryption and decryptionprograms. For the encryption, the plaintext and the key need to be input. To inputthe key, use the permutation of 0, 1, . . . , 28. The plaintext should be input as Englishletters. The out put will be the ciphertext which is also English letters. Select aparagraph of text which contains more than 25 words (I don’t think any two peoplewill choose a same paragraph if they choose independently) and encrypt it using yourencryption algorithm. Then use your decryption program to check the correctness.You can use Java. Record your plaintext, ciphertext and the key π in your answer sheet.
Experiment 1: IMPLEMENTATION OF CAESAR CIPHER Objective: To implement the simple substitution technique named Caesar cipher using C+ language. Theory: To enerypt a message with a Caesar cipher, each letter in the message is changed using a simple rule: shift by three. Each letter of the message is shifted a fixed distance (3 for example) down the alphabet, A becomes D, B becomes E, and so on. For the last letters, we can think of alphabet as a circle and "wrap around", W becomes Z. X becomes A, Y becomes B, and Z becomes C. To change a message back, cach letter is replaced by the one three before it. Example ABCDEFGHIJKLMNOPQRSTUVWXYZ t t t t t t t t ttt t t t t t t tt t t t t t t ft DEFGHIJKLMNOPQRSTUVW XY Z ABc) digorithm STEP-1: Read the plain text from the user. STEP-2: Read the key value from the user. STEP-3: If the key is positive then encrypt the text by adding the key with each character in the plain text. STEP-4: Else subtract the key from the plain text. STEP-5: Display the…
list.JPG 6. Ten charges placed on a plate. Write a Python script to enter the value for the ith charge in a list q[10] and the distance from the center to the ith charge in another list r[10] then find and print the electrical potential (E) in the center of this plate according to the following equation: 1 E = 4 πε . where eo= 8.85 x1012 II
Write a program to handle a user's rolodex entries. (A rolodex is a system with tagged cards each representing a contact. It would contain a name, address, and phone number. In this day and age, it would probably have an email address as well.) Typical operations people want to do to a rolodex entry are: 1) Add entry 2) Edit entry 3) Delete entry 4) Find entry 5) Print all entries 6) Quit You can decide what the maximum number of rolodex entries is and how long each part of an entry is (name, address, etc.). When they choose to edit an entry, give them the option of selecting from the current rolodex entries or returning to the main menu — don't force them to edit someone just because they chose that option. Similarly for deleting an entry. Also don't forget that when deleting an entry, you must move all following entries down to fill in the gap. If they want to add an entry and the rolodex is full, offer them the choice to return to the main menu or select a person to overwrite. When…
Numbers between 0 and 15 are stored in the memory location starting from physical address B000Fh randomly. Write a program which finds the element order number in the string starting from 0 to 15 and writes to physical address C000Fh. (Eg: "1" is 2nd element in the first string, "2" is 4th element, ....etc)
Bb1. 3. Write an algorithm in pseudocode for the procedure to input two numbers (X, Y), and add 3 to the smaller number. Output both numbers.
USING JAVA Implement a program to divide a sentence into words, encode these words and display them on the screen. The encoding rule: 'a'->'b', 'b'->'c', ..., 'y'->'z', 'z'->'a', 'A'->'B', 'B'->'C', ..., 'Y'->'Z', 'Z'->'A'. Note that delimiters are commonly used punctuation marks like: ',', '.', ';', ':', '\'', '?', '!'. For example, input sentence "Hello World", the program divides it into two words: "Hello" and "World" and encodes them into "Ifmmp" and "Xpsme" respectively.
Implement in C Program 5.20 LAB: Word frequencies Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain fewer than 20 words, and each word contains fewer than 10 characters. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey - 1 hi - 2 Mark - 1 hi - 2 mark - 1 Hint: Use two arrays, one array for the strings and one array for the frequencies. #include <stdio.h>#include <string.h> int main(void) { /* Type your code here. */ return 0;}
A robot is placed at the origin of a 2D coordinate plane (i.e. position (0, 0)). The robot is given a string Scontaining N characters in {N, E, S, W} as its instructions. For each character from the beginning of the string,the robot has to move 1 unit to the following direction:• If the character is N, the robot has to move 1 unit to the positive y-axis direction.• If the character is E, the robot has to move 1 unit to the positive x-axis direction.• If the character is S, the robot has to move 1 unit to the negative y-axis direction.• If the character is W, the robot has to move 1 unit to the negative x-axis direction.You do not know the string S. However, you know another string P that is an anagram of S (i.e. P has thesame number of N, E, S, W characters as S). You also have M data points: T1...M, X1...M, and Y1...M. For alli, you know that the robot is at position (Xi, Yi) after moving exactly Ti units.You want to know the number of possible string S that satisfies all the…
The language used for the code is fortran 2008. Thank you 1. There are many algorithms that can be used to encrypt a message. One of these algorithms can be described as follows: • Choose a “code word”. For example, “fortran”. • Assign integer values to each of the characters in the code word corresponding to their placement in the alphabet. In the case of the code word “fortran”, the integer values would be (6, 15, 18, 20, 18, 1, 14). • Change each character in the message to be encrypted by adding the code word values determined above (in order) to each of the characters in the message to be encrypted. The code word is reused as many times as necessary. For example, suppose that we want to encrypt the message “hello”, we would first determine the integer values for each character in the message (8, 5, 12, 12, 15). Each of these values would be modified by adding the code word values, ie. (8+6, 5+15, 12+18, 12+20, 15+18) = (14, 20, 30, 32, 33). The resulting values are then translated…
Implement the first round of AES ( Advanced Encryption Standard ) in python. Given a message with 128 bits, two subkeys subkey0 and subkey1, your program should be able to perform one AddKey before Round 1 and the corresponding operations (SubBytes, ShiftRows, Mix-Columns, and AddKey) in Round 1, and output the result of the encryption after Round 1.
Introductory: The Caesar Cipher technique is one of the earliest and simplest methods of encryption techniques. It is simply a type of substitution cipher, i.e., each letter of a given text is replaced by a letter some fixed number of positions down the alphabet. For example, with a shift of 1, A would be replaced by B, B would become C, and so on. The method is apparently named after Julius Caesar, who apparently used it to communicate with his officials. Thus, to cipher a given text we need an integer value, known as a shift which indicates the number of positions each letter of the text has been moved down. The encryption can be represented using modular arithmetic by first transforming the letters into numbers, according to the scheme, A = 0, B = 1 ,…, Z = 25. Encryption of a letter by a shift n can be described mathematically as. En(x) = (x+n) mod 26 (Encryption Phase with shift n) Write an algorithm and implement a program in C to read the data from a file (called…