The Caesar Cipher was a way of coding correspondence used by Julius Caesar. Encryption involves swapping each unencrypted letter with the letter shifted N positions left. When the range is exceeded, the alphabet is wrapped around. Write a function implementing the variation of the Caesar cypher, which assumes that subsequent shifts are the successive numbers of your album number (ignore letters). When the numbers from the album number run out, start from the beginning. The function should have two arguments: unencrypted string and album number, the function should return an encrypted string. Use the Latin alphabet, only lowercase letters. Spaces should remain unencrypted. For example in the case of N=3, the letter 'e' is replaced with 'b', and letter 'c' is replaced with 'z'

The Caesar Cipher was a way of coding correspondence used by Julius Caesar. Encryption involves swapping each unencrypted letter with the letter shifted N positions left. When the range is exceeded, the alphabet is wrapped around. Write a function implementing the variation of the Caesar cypher, which assumes that subsequent shifts are the successive numbers of your album number (ignore letters). When the numbers from the album number run out, start from the beginning. The function should have two arguments: unencrypted string and album number, the function should return an encrypted string. Use the Latin alphabet, only lowercase letters. Spaces should remain unencrypted. For example in the case of N=3, the letter 'e' is replaced with 'b', and letter 'c' is replaced with 'z'

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

Example 2 Enter message to be encrypted: Dèyè mòn, gen mòn. Enter step size: -1 ORIGINAL MESSAGE Dèyè mòn, gen mòn. ENCRYPTED MESSAGE Cçxç lim, fdm lim. Enter message to be encrypted: Dèyè mòn, gen mòn. Enter step size: 0 ORIGINAL MESSAGE Dèyè mòn, gen mòn. ENCRYPTED MESSAGE Dèyè mòn, gen mòn. Enter message to be encrypted: QUIT Example 3 Enter message to be encrypted: Perfer et obdura, dolor hic tib: proderit olim. Enter step size: 8 ORIGINAL MESSAGE Perfer et obdura, dolor hic tibi proderit olim. ENCRYPTED MESSAGE Xmznmz m| wjl)zi, lwtwz pąk |qją xzwlmzą| wtqu. Enter message to be encrypted: QUIT
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.
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…
A simple and very old method of sending secret messages is the substitution cipher. You might have used this cipher with your friends when you were a kid. Basically, each letter of the alphabet gets replaced by another letter of the alphabet. For example, every 'a' get replaced with an 'X', and every 'b' gets replaced with a 'Z', etc. Write a program thats ask a user to enter a secret message. Encrypt this message using the substitution cipher and display the encrypted message. Then decryped the encrypted message back to the original message. You may use the 2 strings below for your subsitition. For example, to encrypt you can replace the character at position n in alphabet with the character at position n in key. To decrypt you can replace the character at position n in key with the character at position n in alphabet. Have fun! And make the cipher stronger if you wish! Currently the cipher only substitutes letters - you could easily add digits, puncuation, whitespace and so forth.…
A Caesar cipher is a simple substitution cipher based on the idea of shifting each letter of the plaintext message a fixed number (called the key) of positions in the alphabet. For example, if the key value is 2, the word "Sourpuss" would be encoded as "Uqwtrwuu." The original message can be recovered by “reencoding" it using the negative of the key. Write a program that can encode and decode Caesar ciphers. The in- put to the program will be a string of plaintext and the value of the key. The output will be an encoded message where each character in the orig- inal message is replaced by shifting it key characters in the Unicode char- acter set. For example, if ch is a character in the string and key is the amount to shift, then the character that replaces ch can be calculated as: chr (ord (ch) + key). 62
This is a substitution cypherEach letter is replaced by another letter with no repetitionIgnore spaces and punctuationYou must account for spaces (I ignored them, but there are other legitimate responses.)The best program will also account for punctuation and other symbols. (Ignoring them is fine.) Your program can ignore these special characters when they occur, but it should not crash if it encounters a strange character.Manage CapitalizationIn most cryptographic applications, all letters are converted to uppercase. Please follow this convention or deal with potential case conversion problems in another way.Use FunctionsYou may not make significant changes to the main function. Determine which functions are necessary and create them. (The blackbelt project does allow for one slight modification, noted below.) Do not turn in a program with only a main() function!! Write the code necessary for Python to run the main function as expectedPass data between functionsYour functions may…
Correct answer will be upvoted else downvoted. number is called 2050-number if it is 2050, 20500, ..., (2050⋅10k for integer k≥0). Given a number n, you are asked to represent n as the sum of some (not necessarily distinct) 2050-numbers. Compute the minimum number of 2050-numbers required for that. Input The first line contains a single integer T (1≤T≤1000) denoting the number of test cases. The only line of each test case contains a single integer n (1≤n≤1018) denoting the number to be represented. Output For each test case, output the minimum number of 2050-numbers in one line. If n cannot be represented as the sum of 2050-numbers, output −1 instead.
A spy is undercover in the hostile country of Phonemia. In order not to waste scarce resources, every time he wants to send a message home, he removes all punctuation marks from the message and converts all letters to uppercase. So, for example, to send the message, “Abort the plan! See you in the Dark Cabin.” he would transmit "ABORTTHEPLANSEEYOUINTHEDARKCABIN” Given such a string, S, of n capital letters. Seeks to reconstruct the document using a dictionary, which is available in the form of a boolean function dict(w), where dict(w) is true if the string w is a valid word in the language. Give an algorithm O(n^2) that determines whether the string S can be reconstituted as a sequence of valid words, assuming calls to dict(w) take O(1) of time. To solve the problem consider: • Indicate the subproblems • Define the recurrence • Propose a pseudocode • Perform a quick Big O analysis of the algorithm
The Reflection algorithm can be used to encrypt a C-string (character array terminated with the null character) before it is transmitted over the Internet. The Reflection algorithm works as follows: Each letter in the message is converted to the letter in that is 13 positions to the right of that letter in the English alphabet. If the end of the alphabet is reached, counting continues from the first letter in the alphabet. The case of the letters must be maintained. For example,'M' →'Z', 'x' → 'k', 'A' → 'N'The numeric characters ('0' to '9') are shifted 5 positions to the right of that number in the character set '0' to '9'. If ‘9’ is reached, counting continues from ‘0’. For example,'0' → '5', '2' →'7', '8' → '3' All other characters are left as they are. a) What would the following string be encrypted to by the Reflection algorithm?“Call me at 662-2002 Ext 85393” b) Write a function, getPosition, which finds the position of a letter in the alphabet regardless of the case of the…
Python The Dan Cipher works like this: shift the first lowercase character to the right by 1, the second lowercase character to the right by 2, and so on. Characters that are not lowercase characters are not changed. Write a program that takes a string and prints the result of applying the Dan Cipher.
You have a card on which the letter J is written on one side and K on the other. You want to seeall of the possible ways the card will land if you drop it n times. Write a recursive method thatprints each session of dropping the cards with J's and K's. For example if you drop it 4 times in agiven session, all possible ways to drop it are as follows (in exactly the specified order): J J J JJ J J KJ J K JJ J K KJ K J JJ K J KJ K K JJ K K KK J J JK J J KK J K JK J K KK K J JK K J KK K K JK K K K
Here is the assignment Write a program that prints the multiplication table but inserts a randomly generated incorrect value between 1 and 50 into a cell whose row and column are randomly selected. Make sure the program does insert an incorrect value. For example, if row and column of 3 and 4 are randomly selected, keep generating a random number to print for that location until it's not the right value of 12. Then, ask the user to tell where in the table the incorrect number is located by entering the row and column of the incorrect number. Print whether the user was right or not. If he or she was right, ask for and read the correct value; if not, the program must give the correct location and the correct number. My main issue: is how to set up the multiplication table? I've only learned the basics in C++ (loops and if statements).