Recall that in regular DES, 8 bits of the initial 64-bit key are thrown away, so that the actual encryption only proceeds with the remaining 56 bits and so that an attacker Oscar really only needs those 56 bits to reveal the plaintext. (That is, even though the true keyspace has size 2^64, the keyspace for the keys actually used has size 2^56.) Discuss then whether beginning with a 64-bit key has any merit and if Oscar can simply skip the PC-1 step of DES entirely in carrying out a brute force attack.

Recall that in regular DES, 8 bits of the initial 64-bit key are thrown away, so that the actual encryption only proceeds with the remaining 56 bits and so that an attacker Oscar really only needs those 56 bits to reveal the plaintext. (That is, even though the true keyspace has size 2^64, the keyspace for the keys actually used has size 2^56.) Discuss then whether beginning with a 64-bit key has any merit and if Oscar can simply skip the PC-1 step of DES entirely in carrying out a brute force attack.

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

Provide a solution to the problem described below by identifying the security flaws in each authentication technique. When Bob hashes a password, he compares it to a database of previously hashed passwords. Bob applies a hashing algorithm to a password before comparing it to a database of hashed passwords.
2. Describe the flaw in this argument: Consider the following attack against one-time pad: upon seeing a ciphertext c, the eavesdropper tries every candidate key k e {0,1}^ until she has found the one that was used, at which point she outputs the plaintext m. This contra- dicts the argument in the book that the eavesdropper can obtain no information about m by seeing the ciphertext.
question
Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl. We conduct a known-plaintext attack against an LFSR. Through trial and error we have determined that the number of states is m = 4. The plaintext given by 01100101 —D ХоXјX2XҙX4X5X6X7 when encrypted by the LFSR produced the ciphertext 10010100 — Уo У1 У2 Уз Уз У5 У6 Ут- What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 0101 to represent P3 = 0, p2 = 1, Pi = 0, po = 1).
In the Elgamal encryption scheme, Bob's public key is fixed, but Alice uses a fresh random i e {2,...,p – 2}, and hence a fresh random kg, whenever she wants to send Bob a message. What happens if Alice uses the same i for ecrypting multiple messages? Can Trudy recover any meaningful information from the ciphertexts?
In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 77 ASCII characters. You can review the ASCII characters here.. Exactly 27=12827=128 of these codes are for printable characters; we will assume every character in the password is printable. What is the size of the keyspace that consists of passwords of this form?What is the equivalent key length in bits? Assuming that you could check one password every 10−810−8 seconds, what is the worst case running time for cracking this password by brute force search (in days)? Now assume that the user used only 3131 characters from the keyboard. What is the key length in bits in this case? How many days, in the worst case, would it take to break this weaker password? You can't round to the nearest day here -- be as exact as possible. Supposing you used only 3131 characters, how long is the shortest password that achieves 252252 bits of security?
Consider an RSA key set for Alice with p = 23, q = 17, n = 391 and e = 15.a) Her public key is (e, n) = (15, 391). Is her private key (d, n) = (47, 391)? Justffy your answer. b) Suppose Bob wants to encrypt a message 90 for Alice using RSA keys for confidenVality. Whatis the corresponding cipher text?Justify your answer.
4. We want to use RSA in our communication and we start with prime numbers p = 3 and q = 5. (a) Find a suitable integer e and compute the integer N, to specify the public key tuple of (E, N). (b) Find the private key D where D is the inverse of e in modulo (p-1)*(q-1) (c) Encrypt the plainnumber 12 to obtain the ciphernumber C. Demonstrate your calculations. (d) Decrypt C to obtain 12 again. Demonstrate your %3D calculations.
In this problem we explore the relationship between password length and cryptographic security. Suppose a password consists of 6 ASCII characters. You can review the ASCII characters here.. There are exactly 2' = 128 ASCII characters; we will assume every character in the password is ASCII (non-printing characters are allowed). What is the size of the keyspace that consists of passwords of this form? What is the equivalent key length in bits? Assuming that you could check one password every 10-" seconds, what is the worst case running time for cracking this password by brute force search (in days)?| Now assume that the user used only 28 characters from the keyboard. What is the key length in bits in this case? How many days, in the worst case, would it take to break this weaker password? You can't round to the nearest day here be as exact as possible. Supposing you used only 28 characters, how long is the shortest password that achieves 248 bits of security?
We want to set up RSA cryptosystem in a network of n users. a. How many prime numbers do we have to generate a key for users? b. Now consider we want to reduce this number by generating a smaller pool of prime numbers and making combinations of two of these primes (for each user we pick up a new pair). How is security of RSA cryptosystem affected?
Alice and Bod have decided to use a symmetric encryption algorithm. They have some assumptions about their messages:- Messages only contain capital letters (i.e. A to Z)- The length of their shared key must be greater than or equal to the length of the plaintext- They assign each letter a number as follows: (A,0), (B,1), (C,2), (D,3),…, (Z,25)Their algorithm combines the key and the message using modular addition. The numerical values of corresponding message and key letters are added together, modulo 26. For example, if the plain text is “HELLO” and the key is “SECRET” then the encrypted message is calculated as following:Since the length of the plaintext is 5, we just need the first 5 letters of the key (i.e. “SECRE”), then for each letter, we should add corresponding letters in both the plaintext and the key modulo 26.Plaintext: H (7) E (4) L (11) L (11) O (14)Key: S (18) E (4) C (2) R (17) E(4)Cipher: Z (25) I (8) N(13) C(2) S (18) Write a program in Python, C/C++ or JavaScript to…