As per 2021 it is expected that cyber security attacks will give loss of 14 trillion US dollars. This is one of the alarming issues which need high attention to make sure data and information is fully protected. As Computing professional students are expected to take input from the user as string of 30 characters which can include a-z, A-Z only and convert them to encrypted text with using the following rules: A will be converted to 32, B will be converted to 34, C will be converted to 36 and so on... And a will be converted to 31, b will be converted to 33, c will be converted to 35 and so on...

As per 2021 it is expected that cyber security attacks will give loss of 14 trillion US dollars. This is one of the alarming issues which need high attention to make sure data and information is fully protected. As Computing professional students are expected to take input from the user as string of 30 characters which can include a-z, A-Z only and convert them to encrypted text with using the following rules: A will be converted to 32, B will be converted to 34, C will be converted to 36 and so on... And a will be converted to 31, b will be converted to 33, c will be converted to 35 and so on...

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

Alice and Bob are two fugitives from justice. Alice sent Bob an encrypted message to inform him about her following secret meeting location. As a cryptanalyst, it is your mission to help the police in decoding the message that contains the room number and the hotel name. Alice’s SECRET MESSAGE IS: 7F7F Norzut jkgjykg Use Cryptool to decrypt the secret message using Caesar cipher. Assume the following: 1. The value of the first alphabet is zero 2. Alphabet set includes: numerals, uppercase, and lowercase letters of the English language 3. Try keys from 0-10 until you find the correct key. a. What is the secret message? b. What key did you use to decrypt it c. How many possible substitutions exist in this exercise (exclude the space)?
Modify the codes with the same problem. 1.) decrypt code = input("Enter the coded text: ") distance = input("Enter the distance value: ") plainText = '' for ch in code: ordValue = ord(ch) cipherValue = ordValue - distance if cipherValue < ord('a'): cipherValue = ord('z') - (distance) - \ (ordValue - ord('a') - 1) plainText += chr(cipherValue) print(plainText) 2.) Encrypt plainText = input("Enter a one-word, lowercase message: ") distance = int(input("Enter the distance value: ")) code = "" for ch in plainText: ordValue = ord(ch) cipherValue = ordValue + distance if cipherValue > ord('z'): cipherValue = ord('a') + distance - \ (ord('z') - ordValue + 1) code += chr(cipherValue) print(code)
Question 2: Encryption is a process to secure your data. Caesar Cipher is one of the method to encrypt the data. In this method we need a key to encrypt data. Now using that key one character is replaced with another one. [small or capital alphabets are allowed, otherwise invalid input] Write a C++ program in which, read a character and an integer key from user. Now encrypt the character using given key. Example 1: Sample input: Enter a character: a Enter key: 3 Sample output: Encrypted character is: d Example 2: Sample input: Enter a character: Z Enter key: 3 Sample output: Encrypted character is: C Example 3: Sample input: Enter a character: @ Enter key: 3 Sample output: Invalid input
21. RSA problem: given plaintext P, e, prime numbers p, q, compute ciphertext C. Decrypt C and verify you get plaintext P back.
****NEEDS TO BE WRITTEN IN PYTHON**** Use the strategy of the decimal to binary conversion implemented in Project 4, and the bit shift left operation defined in Project 5 to code a new encryption algorithm. The algorithm should Add 1 to each character’s numeric ASCII value. Convert it to a bit string. Shift the bits of this string one place to the left. A single-space character in the encrypted string separates the resulting bit strings.
Chandu and chandni Talk on phone for a long time daily. Being afraid that someone will hear their private conversation chandu suggested chandni an idea. He suggested that he will talk only with encrypted strings with her and only she would know, how to decrypt the string. So that even if someone hears, He/She would not be able to anticipate their conversation. Rules of encryption are as follows:1. String on length N is assumed to be cyclic consisting of lower case English alphabets.2. In each iteration, we pick the last character and put it in starting of the string. For example: april performing iterations and collecting each string formed in a set until we get the original string. Ex: {april,lapri, ilapr, rilap, prila}3. sort the set of string in lexicographically reverse order. Ex: {rilap, prila,lapri, ilapr, april }4. Taking the last character of each string in the set is the encrypted string. Ex: pairl Chandu also sends the position(K) of first letter in encrypted string from…
Write Algorithm and related theory of the following problem. Do not write code. C++: When a message is transmitted in secret code over a transmission channel, it is usually sent as a sequence of bits, that is, 0s and 1s. Due to noise in the transmission channel, the transmitted message may become corrupted. That is, the message received at the destination is not the same as the message transmitted; some of the bits may have been changed. There are several techniques to check the validity of the transmitted message at the destination. One technique is to transmit the same message twice. At the destination, both copies of the message are compared bit by bit. If the corresponding bits are the same, the message received is error-free. Response Required: Write a program to check whether the message received at the destination is error-free. For simplicity, assume that the secret code representing the message is a sequence of digits (0 to 9) and the maximum length of the message is 250…
Messages are to be encoded using the RSA method, and the primes chosen are p =13 and q = 23, so that n pq = 299. The encryption exponent is e = 13. Thus, the public key is (299, 13.) (a) Use the repeated squaring algorithm to find the encrypted form c of the message m = 84. (b) Show that the decryption exponent d (the private key) is 61. (c) Verify that you obtain the original message after decryption. Use the repeated squaring algorithm.
Write a program using c++, to encrypt and (then decrypt) using Playfair cipher. The program should prompt the user to input a key word to generate the Key Grid. In addition, the user must input plaintext (ciphertext) and the program should display the corresponding cipher text (plaintext). And describe the algorithm.
An early attempt to force users to use less predictable passwords involved computer supplied passwords. The passwords were eight characters long and were taken from the character set consisting of lowercase letters and digits. They were generated by a pseudo-random number generator with 2^15 possible starting values. Using the technology of the time, the time required to search through all character strings of length 8 from a 36-character alphabet was 112 years. Unfortunately, this is not a true reflection of the actual security of the system. Explain the problem
RSA involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key. Generate Public and private keys for the below given prime numbers: p = 13339 q = 13499 p = 98981, q = 98993 All the steps in generating the keys need to be shown clearly.
Alice wants to send Bob her account number for his dining dollars. Bob’s account number is 24. Bob wants to encrypt her account number using the RSA algorithm scheme as evil Eve wants to steal her money to buy M&Ms. Bob chooses two prime numbers, 23 and 37, and uses them to compute the number m. Bob then computes the number e and the number d by using things he knows about the number m and its relationship to e. Bob sends the number e and the number m to Alice and she uses them to encrypt her number A and obtains the number C. C is the encrypted version of her code. Alice sends the number C to Bob, and then Bob uses the number d to decrypt Alice’s message. Using this information, encrypt and decrypt the message to show that the RSA algorithm works, then in a few words explain what makes the algorithm secure if the key for encrypting is always public.