1- A simple encryption method is being used to encrypt a small number (called the secret number). The method by which this encryption works is as follows: I. Choose a random seed number II. Calculate the key by multiplying the seed with the secret under modulus 7 III. Finally, multiply the key with the secret to get the encrypted secret Example: If our secret number was 45Randomly choose seed = 6 key = secret x seed (mod 7) = 45 x 6 (mod 7) = 4Encrypted Secret = key x secret = 45 x 4 = 180 Based on this encryption method, when choosing the random seed, show which number should not be used, because it would result in the Secret and the Encrypted Secret being the same.

1- A simple encryption method is being used to encrypt a small number (called the secret number). The method by which this encryption works is as follows: I. Choose a random seed number II. Calculate the key by multiplying the seed with the secret under modulus 7 III. Finally, multiply the key with the secret to get the encrypted secret Example: If our secret number was 45Randomly choose seed = 6 key = secret x seed (mod 7) = 45 x 6 (mod 7) = 4Encrypted Secret = key x secret = 45 x 4 = 180 Based on this encryption method, when choosing the random seed, show which number should not be used, because it would result in the Secret and the Encrypted Secret being the same.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter4: Selection Structures

Section: Chapter Questions

Problem 14PP

See similar textbooks

Similar questions

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…
Crypto Columns The columnar encryption scheme scrambles the letters in a message (or plaintext) using a keyword as illustrated in the following example: Suppose BATBOY is the keyword and our message is MEET ME BY THE OLD OAK TREE. Since the keyword has 6 letters, we write the message (ignoring spacing and punctuation) in a grid with 6 columns, padding with random extra letters as needed: MEETME BYTHEO LDOAKT REENTH Here, we've padded the message with NTH. Now the message is printed out by columns, but the columns are printed in the order determined by the letters in the keyword. Since A is the letter of the keyword that comes first in the alphabet, column 2 is printed first. The next letter, B, occurs twice. In the case of a tie like this we print the columns leftmost first, so we print column 1, then column 4. This continues, printing the remaining columns in order 5, 3 and finally 6. So, the order the columns of the grid are printed would be 2, 1, 4, 5, 3, 6, in this case. This…
Lab Assignment 1: Vigenere Cipher Overview: You are required to implement the Vigenere Cipher using any programming language of your choice. Your program should be able to encrypt any given message written in text. Your program should allow the user to submit a message for encryption (the message must use text only). You should use the following message to demonstrate the encryption: “Party on the Quad." Your program should allow the user to input the key for performing the encryption. Please use the following key to demonstrate the encryption process: "Homecoming."
Substitution ciphers are encryption/decryption algorithms that replace one letter or number with another. The first attested use of a substitution cipher in military affairs was by Julius Caesar, described by him in Gallic Wars (cf. Kahn pp83-84). In caesar cipher , you replace each letter by 3rd letter on. If it is out of bound (later than Z), then round to the head (letter A) and continue the shift. For example:meet me after the toga party PHHW PH DIWHU WKH WRJD SDUWB Please write a program in Java to implement the Caesar Cipher: a. Implement the encryption algorithm. Ask the user to input one all lower case normal sentence (called plaintext) using the nextLine method, and then output the encrypted text (called ciphertext). b. Implement the decryption algorithm. Ask the user to input one encrypted sentence (i.e. ciphertext) using the nextLine method, and then output the decrypted text (i.e. plaintext).
A fish-finder is a device used by anglers to find fish in a lake. If the fish-finder finds a fish, it will sound an alarm. It uses depth readings to determine whether to sound an alarm. For our purposes, the fish-finder will decide that a fish is swimming past if:there are four consecutive depth readings which form a strictly increasing sequence (such as 3 4 7 9) (which we will call "Fish Rising"), orthere are four consecutive depth readings which form a strictly decreasing sequence (such as 9 6 5 2) (which we will call "Fish Diving"), orthere are four consecutive depth readings which are identical (which we will call "Constant Depth").All other readings will be considered random noise or debris, which we will call "No Fish."Create a Python program called "fishfinder_firstname_lastname" that takes 1 input of string of 4 numbers separated with comma. Your program must display "Fish Rising", "Fish Diving.", "Fish At Constant Depth" or "No Fish".Example:30,10,20,20 Must display No…
The greatest common divisor of two positive integers, A and B, is the largest number that can be evenly divided into both of them. Euclid's algorithm can be used to find the greatest common divisor (GCD) of two positive integers. You can use this algorithm in the following manner: 1. Compute the remainder of dividing the larger number by the smaller number. 2. Replace the larger number with the smaller number and the smaller number with the remainder. 3. Repeat this process until the smaller number is zero. The larger number at this point is the GCD of A and B. Write a program that lets the user enter two integers and then prints each step in the process of using the Euclidean algorithm to find their GCD. An example of the program input and output is shown below: Enter the smaller number: 5 Enter the larger number: 15 The greatest common divisor is 5
Strength Checker for Password Systems: For a given password system, calculate the search space for a general user and a lazy user. Suppose only 11 special characters can be input. Program with any language. Input (by the evaluator): 1st line: number of characters 2nd line: numbers allowed [Y/N]? must be included [Y/N]? 3rd line: letters allowed [Y/N]? case sensitive [Y/N]? must be included [Y/N]? 4th line: special character allowed [Y/NJ? must be included [Y/N]? Output: 1st line: The search space for a general user is (). 2nd line: The search space for a lazy user is (]. Example: Input: 6 YY YYY YY Output: The search space for a general user is 1.43*10^11. The search space for a lazy user is 2.68*10^9. in java code
PLEASE CODE IN PYTHON Crypto Columns The columnar encryption scheme scrambles the letters in a message (or plaintext) using a keyword as illustrated in the following example: Suppose BATBOY is the keyword and our message is MEET ME BY THE OLD OAK TREE. Since the keyword has 6 letters, we write the message (ignoring spacing and punctuation) in a grid with 6 columns, padding with random extra letters as needed: MEETME BYTHEO LDOAKT REENTH Here, we've padded the message with NTH. Now the message is printed out by columns, but the columns are printed in the order determined by the letters in the keyword. Since A is the letter of the keyword that comes first in the alphabet, column 2 is printed first. The next letter, B, occurs twice. In the case of a tie like this we print the columns leftmost first, so we print column 1, then column 4. This continues, printing the remaining columns in order 5, 3 and finally 6. So, the order the columns of the grid are printed would be 2, 1, 4, 5, 3, 6, in…
example: use the above key, if the letter "a" appeared in the message, it would be replaced with "g" since "g" in the adjacent letter. Return the encrypted message. Examples encrypt("ab c", "abc ab") → "ba cba" encrypt("otorhinolaryngological", "My name is Paul") "Mr olme
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.
Java Program Scenario: A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, the student opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If the locker is open, the student closes it; if it is closed, the student opens it. After all the students have taken their turns, some of the lockers are open and some are closed. Write a program that prompts the user to enter the number of lockers in a school. After the game is over, the program outputs the number of lockers and the…
In cpp Room contains nx n cubes (in rows and in columns). Each cube is white or black. You can get out of a white cube by going in one of the four directions horizontally or vertically (but you can't go outside the room). You can enter a black cube, but you can't exit it. There is a mouse and a piece of cheese in the room. The mouse is in a cube (0,0) - white, and the cheese in a cube (n-1, n-1) - black. The mouse can move from cube to cube according to the rules described above. Write a program that finds all the ways in which the mouse can move to the cheese, and if any, display it with ‘*’.