**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

Problem 2. (a) Describe the steps of the Diffie-Hellman key exchange protocol to generate the shared secret akıka between Bob and Alice, where a = 5 is a primitive element modulo 23, ki = 5 and k2 = 8. (You do not need to verify that 5 is a primitive root modulo 23. Do the computations explicitly in Step 2 and Step 4.) (b) Alice then uses their shared secret as a key for a shift cipher to send Bob her favorite tv series and Bob receives the ciphertext ZNK COXK. What is her favorite tv series? Recall: A BCDE F HIJ K M N P Q R S U V W| X Y 2 4 7 89 10 11 12 13 14 15 16 | 17| 18 | 19 | 20 | 21 22 23 24 25
find a
Please see attached
(1) (Chosen ciphertext attack for affine cipher.) Choose AB for the ciphertext. This gives 1ịa + B = 0 (mod 26) 120 +ß = 1 (mod 26) for some r1, 12. Solve for a, ß.
Blood Filter Problem: Suppose we have a dictionary of 2 million words and we wish to have a 0.015 probability of rejecting a password not in the dictionary. If we choose 5 hash functions, what will be the bytes required for the dictionary and what will be the compression ratio
Asymtotic Analysis : Prove the following claims
Use Python scripts or other scripts to solve this.
.
The 1988 version of X.509 lists properties that RSA keys must satisfy to be secure, given current knowledge about the difficulty of factoring large numbers. The discus- sion concludes with a constraint on the public exponent and the modulus n: It must be ensured that e > log₂(n) to prevent attack by taking the eth root mod n to disclose the plaintext. Although the constraint is correct, the reason given for requiring it is incorrect. What is wrong with the reason given and what is the correct reason?
Cryptoghraphy question : a. Describe the RSA encryption and decryption algorithms b. Consider using RSA encryption with n = 209 = (11)x(19). What is wrong with using e = 5 as the encryption key? What is the smallest and the largest e that would work?
A.Given p=25, q=9, and e=7, generate the public key (n,e) and the private key (n,d) using the RSA Key generation algorithm. (Use Excel for computations) b. Given Bob's public key of (85, 7) and private key of (85, 55), show how Alice can encrypt m=3 to send to Bob. Show the ciphertext. c. Given Bob's public key of (85, 7) and private key of (85, 55), show how Bob can decrypt the ciphertext y=2 received from Alice. Show the plaintext. d. Using the fast exponentiation method, determine 530 mod 47. Show your work.
Aes algorithm for symmetric cryptography a) In AES Given the plaintext (000102030405060708090A0B0CEOF) and the key (01010101010101010101010101010101) Show the original contents of State, displayed as a 4x4 matrix