Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
This cryptography technique is one of the earliest in history. Simply said, it replaces each character with another, k values down the alphabet. Let's consider the English alphabet; assuming k = 4, the following word is encrypted as follows: Word: "hello" 4 letters down the alphabet for "h" is "I", "e" is "i", “I" is “p" and "o" is "s". So, the encrypted word is "lipps". To decrypt it we need to go back 4 letters in the alphabet. A person who knows what k is can only decipher it back. But there are other methods that a Caesar cypher can be broken. Certain letters in English alphabet has a specific frequency in text. For example, usually the frequency of letter "e" is 12%. If one calculates the frequencies of each letter and finds that a certain letter has 12% frequency, then it is most probably a replacement of letter "e". In this case the value for k can easily be guessed and the cypher can be broken. You are going to apply that technique to an integer number of 5 digits. Create a .cpp file named encrypt.cpp. In this program, ask the user to enter a value for k. Then ask the user to enter a 5- digit integer. Encrypt the number using the digit alphabet "0123456789" and store it in another integer variable. Print the value of the encrypted integer. For example: If k is 3, then the number 25764 is encrypted as 58097. When you add 3 to each digit if it passes the value 9, apply a modulus 10 operation on it. Think of a similar solution when you decrypt. Then, create another file decrypt.cpp. Assume that k is already known. Ask the user to enter the k value and then a 5-digit integer. Then decrypt the value to the original. Sample output for encrypt.cpp Enter key value k: 3 Enter a 5-digit integer to encrypt: Encrypted value: 58097 25764 Sample output for decrypt.cpp Enter key value k: 3 Enter a 5-digit integer to decrypt: 58097 Decrypted value: 25764

This cryptography technique is one of the earliest in history. Simply said, it replaces each character with another, k values down the alphabet. Let's consider the English alphabet; assuming k = 4, the following word is encrypted as follows: Word: "hello" 4 letters down the alphabet for "h" is "I", "e" is "i", “I" is “p" and "o" is "s". So, the encrypted word is "lipps". To decrypt it we need to go back 4 letters in the alphabet. A person who knows what k is can only decipher it back. But there are other methods that a Caesar cypher can be broken. Certain letters in English alphabet has a specific frequency in text. For example, usually the frequency of letter "e" is 12%. If one calculates the frequencies of each letter and finds that a certain letter has 12% frequency, then it is most probably a replacement of letter "e". In this case the value for k can easily be guessed and the cypher can be broken. You are going to apply that technique to an integer number of 5 digits. Create a .cpp file named encrypt.cpp. In this program, ask the user to enter a value for k. Then ask the user to enter a 5- digit integer. Encrypt the number using the digit alphabet "0123456789" and store it in another integer variable. Print the value of the encrypted integer. For example: If k is 3, then the number 25764 is encrypted as 58097. When you add 3 to each digit if it passes the value 9, apply a modulus 10 operation on it. Think of a similar solution when you decrypt. Then, create another file decrypt.cpp. Assume that k is already known. Ask the user to enter the k value and then a 5-digit integer. Then decrypt the value to the original. Sample output for encrypt.cpp Enter key value k: 3 Enter a 5-digit integer to encrypt: Encrypted value: 58097 25764 Sample output for decrypt.cpp Enter key value k: 3 Enter a 5-digit integer to decrypt: 58097 Decrypted value: 25764

Database System Concepts
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
icon
Related questions
Question

C++ Nothing too advanced please. Learning the basics

This cryptography technique is one of the earliest in history. Simply said, it replaces each character with another, k values down the alphabet. Let's consider the English alphabet; assuming k = 4, the following word is encrypted as follows: Word: "hello" 4 letters down the alphabet for "h" is "I", "e" is "i", "I" is "p" and "o" is "s". So, the encrypted word is "lipps". To decrypt it we need to go back 4 letters in the alphabet. A person who knows what k is can only decipher it back. But there are other methods that a Caesar cypher can be broken. Certain letters in English alphabet has a specific frequency in text. For example, usually the frequency of letter "e" is 12%. If one calculates the frequencies of each letter and finds that a certain letter has 12% frequency, then it is most probably a replacement of letter "e". In this case the value for k can easily be guessed and the cypher can be broken. You are going to apply that technique to an integer number of 5 digits. Create a .cpp file named encrypt.cpp. In this program, ask the user to enter a value for k. Then ask the user to enter a 5- digit integer. Encrypt the number using the digit alphabet "0123456789" and store it in another integer variable. Print the value of the encrypted integer. For example: If k is 3, then the number 25764 is encrypted as 58097. When you add 3 to each digit if it passes the value 9, apply a modulus 10 operation on it. Think of a similar solution when you decrypt. Then, create another file decrypt.cpp. Assume that k is already known. Ask the user to enter the k value and then a 5-digit integer. Then decrypt the value to the original. Sample output for encrypt.cpp Enter key value k: 3 Enter a 5-digit integer to encrypt: Encrypted value: 58097 25764 Sample output for decrypt.cpp Enter key value k: 3 Enter a 5-digit integer to decrypt: Decrypted value: 25764 58097
Transcribed Image Text:This cryptography technique is one of the earliest in history. Simply said, it replaces each character with another, k values down the alphabet. Let's consider the English alphabet; assuming k = 4, the following word is encrypted as follows: Word: "hello" 4 letters down the alphabet for "h" is "I", "e" is "i", "I" is "p" and "o" is "s". So, the encrypted word is "lipps". To decrypt it we need to go back 4 letters in the alphabet. A person who knows what k is can only decipher it back. But there are other methods that a Caesar cypher can be broken. Certain letters in English alphabet has a specific frequency in text. For example, usually the frequency of letter "e" is 12%. If one calculates the frequencies of each letter and finds that a certain letter has 12% frequency, then it is most probably a replacement of letter "e". In this case the value for k can easily be guessed and the cypher can be broken. You are going to apply that technique to an integer number of 5 digits. Create a .cpp file named encrypt.cpp. In this program, ask the user to enter a value for k. Then ask the user to enter a 5- digit integer. Encrypt the number using the digit alphabet "0123456789" and store it in another integer variable. Print the value of the encrypted integer. For example: If k is 3, then the number 25764 is encrypted as 58097. When you add 3 to each digit if it passes the value 9, apply a modulus 10 operation on it. Think of a similar solution when you decrypt. Then, create another file decrypt.cpp. Assume that k is already known. Ask the user to enter the k value and then a 5-digit integer. Then decrypt the value to the original. Sample output for encrypt.cpp Enter key value k: 3 Enter a 5-digit integer to encrypt: Encrypted value: 58097 25764 Sample output for decrypt.cpp Enter key value k: 3 Enter a 5-digit integer to decrypt: Decrypted value: 25764 58097
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Function Arguments
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS