5. Given the following table. Write a C program to implement Mono-alphabetic ciphe for encrypting and decrypting a given text. CIPHER ALPHABET A H = A O = 0 V = L %3D = V Y %D %3D C J Q U %3D D Q K C R = J Y K L W Z = R F M M S T H G = N N = E U = T Page 2 of II II II II II II II II II II II II

5. Given the following table. Write a C program to implement Mono-alphabetic ciphe for encrypting and decrypting a given text. CIPHER ALPHABET A H = A O = 0 V = L %3D = V Y %D %3D C J Q U %3D D Q K C R = J Y K L W Z = R F M M S T H G = N N = E U = T Page 2 of II II II II II II II II II II II II

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

Similar questions

In C language, write a simple substitution code for an alphabetic string. That is, declare a permutation of the 26 alphabetic characters i.e. char perm[] = “qjczieaungsdfxmphybklortvw” Now, given a message string e.g. char msg[] = “secret message to encode”; Replace all occurrences of ‘a’ with ‘q’ (since perm[0]=’q’) Replace all occurrences of ‘b’ with ‘j’ (since perm[1]=’j’) Replace all occurrences of ‘z’ with ‘w’ (since perm[25]=’w’)So that, the message is modified to “bicyik fibbqai km ixcmzi” This programme should only convert lowercase letters. Any input character that is not a lowercase letter should be left unchanged.
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.
Write a c++ program to determine how many different bits arepresent, given the two hexadecimal strings of length 8. Each hex digit can be represented as four bits.Refer to the sample output below.Sample Runs (2):Enter 2 hex strings separated by one space: FFFFFFFF 00000000Hamming distance: 32 Enter 2 hex strings separated by one space: AAAAA57D AAAAA3B6Hamming distance: 7
C programming Implement an encoder. When completed, your program should be able to accept a short sentence from the user and display an encrypted version of it. For simplicity, let us assume one case of letters throughout, say CAPITALS. We can use a substitution method to scramble a sentence and then use the reverse of this process to recover it. If we take two rows of the alphabet and shift the bottom row along a specified amount (our key), we can then read the letters in our sentence from the top row and use the substituted letter from the bottom row to form the encrypted sentence. A B C D E F G H I J K L M N O P Q R S T U V W X Y Z X Y Z A B C D E F G H I J K L M N O P Q R S T U V W In the example above, the key is 3, hence the second row is shifted by three characters along. Take, for instance, the sentence “HELLO”. Each letter of your message should be replaced by the letter in the alphabet that comes three letters before. For “HELLO” that would be: EBIIL Your program is required…
Write a C++ program to produce the first 90 Fibonacci numbers. A Fibonacci number is one that I is the product of the prior two generated numbers. The sequence is seeded with the values of O and 1, so that the sequence starts off as 0 1123. Fibonacci numbers are used in computing hash table locations for file management systems.
Ciphers use many bitwise operations for cryptography. Write an ARM assembly program to use ciphers. See the steps below to implement the cipher. In this program you will implement a Symmetric Encryption. a) Assign a variable name “Choice” with value 0 or 1 to show the choice for encryption or decryption. 0 for encrypt and 1 for decrypt. . b) If we assign 0 to the variable choice the program will do encryption and if its 1 the program will do decryption. c) For encryption design a key value, for that assign your last nonzero number of your number in a variable called “Key” Example: if your number is 5012345 Assign 5 to the variable Key and use it as the Key for encryption. d) For choice 0 store the Cipher in a variable called “C”, for choice 1 store the Plain text in a variable called “P” (use symmetric Key cryptography and implement that for encryption and decryption). e) Test the encrypt program using the first letter of your name in capital case and to test decryption use the…
Two subroutines in a C# programme create a String object of a given size and a StringBuilder object of the same size, respectively. Utilizing objects from the Timing class that we created at the start of the book, each of the subroutines is timed. Three times are needed to complete this process: once for 100 characters, once for 1,000 characters, and once for 10,000 characters. The times are then given for each size in pairs.
In c++ Now write a program for a double floating pointtype.•What are the number of significant bits that the double’s mantissa can hold, excluding the sign bit.•What is the largest number that a double’s mantissa can hold without roundoff error?•Repeat the program shown on the previous page but set to show where the double’s mantissa starts to exhibit roundoff errors.
Write a program in C that can convert a bit stream of a message into a frame by using Hamming coding. The bit stream is the input parameter of the program. For example, given an input parameter as 1001000, the correct output of the frame is 00110010000. Input bit stream will have 1 to 64 bits. Some self-testing examples are:Input 1001000; output 00110010000Input 1101001100110101; output 011110110011001110101Input 1010101; output 11110100101Input 11111111; output 111011101111 Write a program in C that can convert a bit stream of a message into a frame by using CRC. The bit stream is the first input parameter of the program, which will have 8 to 128 bits. The generator function is the second input parameter of the program, which will have 4 to 16 bits. For example, if the generator function is x^4 + x + 1, the second input will be 10011. The output should be the transmitted bit stream with its CRC checksum bits; see example in Figure 3-9 in the textbook. Some self-testing examples…
Encrypt Caesar cipher is a kind of substitution cipher. Instead of using a substitution table, the alphabets are rotated by a number (a key). For example, if the key is 3, plaintext alphabet a would become d, and plaintext alphabet z would become c. Write a program that implements the Caesar Cipher. You program will first prompt for the key and then for the mode (E for encryption and D for decryption) and finally for the message to be encrypted / decrypted. Your program will then output the encryption / decryption message. For this question, the input message may consists of any character, the program should encrypt or small letter case a to z only. All other characters should be kept intact after encryption or decryption.
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.
Write a C program that reads an integer n and prints the sequence of order n. The first few strings of the sequence are 0, 01, 0110, and 01101001, ... Each successive string is obtained by flipping all of the bits of the previous string and concatenating the result to the end of the previous string. Sample input and output - Input: n = 0 Output: 0 Input: n = 1 Output: 01 Input: n = 2 Output: 0110 Input: n = 3 Output 01101001 Input: n = 4 Output: 0110100110010110