**Knapsack Cryptosystem Example**---### Problem DescriptionGiven:- Superincreasing sequence: \( \mathbf{r} = (1, 3, 7, 15, 30, 61, 124) \).- Constants: \( A = 5 \) and \( B = 253 \).#### (a) Compute the SequenceLet \( M = (M_1, M_2, M_3, M_4, M_5, M_6, M_7) \), where:\[ M_i \equiv A r_i \ (\text{mod} \ B) \ \text{for} \ i = 1, 2, \ldots, 7. \]#### (b) Choose the Binary PlaintextLet the plaintext be \( x = (1, 0, 1, 1, 0, 1, 1) \).Compute the ciphertext:\[ S = x \cdot M. \]#### (c) Compute Intermediate ValueCompute the intermediate value:\[ S' = A^{-1} S \ (\text{mod} \ B). \]#### (d) Solve the Subset-Sum ProblemSolve the subset-sum problem \( S' \) using the superincreasing sequence \( \mathbf{r} \).---### Explanation of Parameters and Steps1. **Superincreasing Sequence \( \mathbf{r} \)**: This sequence is a specific type of sequence where each element is greater than the sum of all previous elements. In this case, \( \mathbf{r} = (1, 3, 7, 15, 30, 61, 124) \).2. **Computing \( M \)**: \[ M_i \equiv A r_i \ (\text{mod} \ B) \] - Multiply each element of \( \mathbf{r} \) by \( A \) and then take modulo \( B \) to find each \( M_i \).3. **Binary Plaintext \( x \)**: A binary vector representing the plaintext message. Each element of the vector is a bit (0 or 1).4. **Ciphertext Calculation**: \[ S = x \cdot M \] - Compute the dot product of the plaintext vector \( x \) with the computed sequence \( M

We have to solve knapsack cryptosystem of all the part is given .

(9) (Knapsack cryptosystem) Let r = (1, 3, 7, 15, 30, 61, 124). Let A = 5 and B = 253. (a) Compute the sequence where M = (M₁, M2, M3, M4, M5, M6, M7) M₁ Arį (mod B) (b) Choose the binary plaintext for i=1,2,...,7. x = (1, 0, 1, 1, 0, 1, 1) and compute the ciphertext S = x. M. (c) Compute S'A¹S (mod B) (d) Solve the subset-sum problem S' using the superincreasing sequence r.

(9) (Knapsack cryptosystem) Let r = (1, 3, 7, 15, 30, 61, 124). Let A = 5 and B = 253. (a) Compute the sequence where M = (M₁, M2, M3, M4, M5, M6, M7) M₁ Arį (mod B) (b) Choose the binary plaintext for i=1,2,...,7. x = (1, 0, 1, 1, 0, 1, 1) and compute the ciphertext S = x. M. (c) Compute S'A¹S (mod B) (d) Solve the subset-sum problem S' using the superincreasing sequence r.

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

Python Knapsack Problem: imagine you are carrying a knapsack with capacity to hold a total of weight C. You are selecting among n items with values A={a_1, a_2, ... , a_n} and associated weights W={w_1, w_2, ... , w_n}. Here the weights and values are all positive. You wish to maximize the total value of the items you select not exceeding the given weight capacity, example, maximize sum_{a in A} such that sum_{w in W} <= C. Note that you can only select your items once. Reformulate this as a bottom-up dynamic programming problem as follows. Define K_{i,j} as the highest possible value sum considering items 1 through i and total weight capacity j (j <= C). What is the base case i.e. K_{0,j} for all j and K_{i,0} for all i. What is the loop statement?
UML Design for Turing Machine Description: An electro-mechanical device used by the British cryptologists to help decipher German Enigma-machine-encrypted secret messages during World War II. A Turing Machine is a very simple abstract model of computation. The machine has an infinite tape that is divided into cells (or squares). Each cell contains a symbol (or character) chosen from some small set of possible symbols. Most of the cells are blank, that is, they contain the blank symbol. The number of non-blank cells is finite. The machine is located on one of the cells, and it can only "see" the symbol in the cell where it is located. It can write a new value to that cell. It can move left or right on the tape, one cell at a time. The machine is in one of a fixed, finite number of possible states. One of the states is the halt state. A Turing Machine has a table of rules. The table of rules is the program for the machine. A rule tells the machine what action to take when it is in a…
Python problem Problem statementDevelop a program that receives a playlist for a game of triqui and determines whether the sequence is valid and, if so, the final result. Player X is always first and O is second. https://i2.wp.com/www.lacoladerata.co/wp-content/uploads/2016/12/triqui2.png?fit=420%2C201&ssl=11.2 -> 3.3 -> 1.3 -> 1.1 -> 2.1 -> 2.2 -> * The winner is: O EntryThe coordinates in format (row, column) of each of the players, alternating between X and O, X plays first. Where 1,1 is the upper left corner and 3,3 is the lower right corner. The end of the game is given by the character "*". DepartureIf there is a winner, the message must be "The winner is: X" or "The winner is: O" without the quotes, as the case may be. Player O corresponds to the capital letter o. In the event of a tie, the message “Tie” must be printed, without the quotation marks. If there is a winner and there are still coordinates, in addition to the message of the winner or tie, it…
Python code: numStations = 3 passengersLeft = {i: [0, 0, 0] for i in range(0, numStations + 1)} explain this line of code
c code Trying to add a line of code that collect real execution time for different values of STRIDE and prints it out also, count the number of times the code prints “Hello” the code i have below
1、Counting Primitive Operations void STRAITMAXMIN(A,n,max,min) //Set the maximum value in A to max and the minimum value to min { int i,n max=min=A[1] for i=2 to n { if A[i]> max max=A[i]; if A[i]< min min=A[i]; } }
docs. قسم علوم الحاسوب- المرحلة الأولى -امتحان مادة ال مطلوب Let U={a,b,c,d,e,f,g), A={a,b.c,d,e}, B={a,b,c,f} C={a,e,f,d,g): find ill Jgull *? complement of (B-A) * ?A*(B NC) 3 3 ae Google c - L TIkrit University
Python Language Q2: Ginormous Campus The campus is pretty big. There are n buildings scattered around it, numbered from 0 to n-1. These buildings are so far away from each other that the only way to get from one to another is to take a campus bus. There are m campus bus routes. The i-th one (0 <= i < m) takes you from building u_i to building v_i (but not the other way around). These buses run very frequently. Professor Zingaro is deciding where to hold his CS lectures. He believes a building x is accessible from a building y if you can get from y to x taking at most two buses. For his students’ convenience, he wants to hold his lectures in the most accessible building. Help him out by telling him how many buildings the most accessible building is accessible from. In addition, list all buildings that are the most accessible. Input The first line of the input contains two space-separated integers n and m, denoting the number of buildings and bus routes, respectively. m lines…
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
Data structure/ C language / Graph / Dijkstra’s algorithm implement a solution of a very common issue: howto get from one town to another using the shortest route.* design a solution that will let you find the shortest paths betweentwo input points in a graph, representing cities and towns, using Dijkstra’salgorithm. Your program should allow the user to enter the input filecontaining information of roads connecting cities/towns. The programshould then construct a graph based on the information provided from thefile. The user should then be able to enter pairs of cities/towns and thealgorithm should compute the shortest path between the two cities/townsentered.Attached a file containing a list of cities/towns with the following data:Field 1: Vertex ID of the 1st end of the segmentField 2: Vertex ID of the 2nd of the segmentField 3: Name of the townField 4: Distance in KilometerPlease note that all roads are two-ways. Meaning, a record may representboth the roads from feild1 to field2…
C++ Programming METHODS AND ALGORITHMS FOR INFORMATION SEARCH Task : Given a set of integers and two keys to search. Describe the steps of searching for keys from a data set using three search algorithms (linear, binary, and block). Make a table of the efficiency of the algorithms and draw a conclusion about the efficient algorithm based on the given data.
Beeblebrox question help required