(e) A file is protected by a random password consisting of n binary bits. All password combinations are equally probable. To access the file we need the correct password. The process of applying the password to the file takes 10ms regardless of the value of n. Brute force attack is always a viable basic strategy for guessing a password. To ensure that the file remains sufficiently secure, we need to ensure that there is no more than a 1% chance over 30 days that the password is guessed by a hacker program utilizing brute force working 24 hours a day, 7 days a week. How many bits should be specified for the password?

(e) A file is protected by a random password consisting of n binary bits. All password combinations are equally probable. To access the file we need the correct password. The process of applying the password to the file takes 10ms regardless of the value of n. Brute force attack is always a viable basic strategy for guessing a password. To ensure that the file remains sufficiently secure, we need to ensure that there is no more than a 1% chance over 30 days that the password is guessed by a hacker program utilizing brute force working 24 hours a day, 7 days a week. How many bits should be specified for the password?

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Money Transfer Max. score: 100 SeaMoney has a feature to transfer money between users. Let's imagine a simple scenario. N usernames--consisting of lowercase Latin characters-each starts with a balance b. Amongst them, T transactions happened, where user ua transfers x amount of money to ub. If x is larger than the ua's balance when the transaction happens, the transaction is automatically rejected. Output the final balance of each user. Input The first line contains two numbers N and T (1 < N,T < 1000). Each of the next N following lines contain username u; (1< ]u;| < 10) and integer b; (1 < b; < 10°), denoting the balance of user u;. Following that (1
Cryptography problem mathematics Suppose Alice and Bob are using a cryptosystem with a 128-bit key, so there are 2128possible keys. Eve is trying a brute-force attack on the system.(a) Suppose it takes 1 day for Eve to try 264 possible keys. At this rate, how long willit take for Eve to try all 2128 keys? (b) Suppose Alice waits 10 years and then buys a computer that is 100 times fasterthan the one she now owns. Will she finish trying all 2128 keys before or after whatshe does in part (a)?
b.What is the maximum amount of time that it would take a computer that can test keys per second to carry out a brute-force attack on a file encrypted using 256-bit AES? Give your answer in seconds and years, using scientific notation, correct to 2 significant figures. You may assume a year is seconds and you may use a calculator to help work out the answer. Show all your working clearly in a way that will help your tutor understand how you arrived at your answer.
Consider the case of Alice sending a message, m, to Bob. Both Alice and Bob use public key cryptography and each has a public and private key as described in the text. The figure attached below shows the operations that Alice must perform to provide confidentiality, authentication, and integrity when sending a message to Bob over the network. We can use either symmetric key or public key cryptography to encrypt a message. For our purposes, either technique will encrypt the message, and applying both doesn't make it "more secure". Also, we can assume that the session key would remain a secret so the fact that it is discarded does not make it "more secure". Why do we use a session key, Ks, instead of relying only on public key Cryptography? In other words, why do we use both public key and symmetric key cryptography?
A password system uses exact 8-character of alphanumeric. To be a secure password system, any password cannot contain the following keywords: (a) All numbers. I.e., must contain at least one letter in the password. (b)User's name. What is the probability of an adversary guessing John Hank's password correctly?
Given the following data file: STUDENT(ID, SNAME, ADDRESS, LEVEL, GPA, …) Suppose that: record size R = 200 bytes block size B = 512 bytes r = 2000 records Then, Find out: Blocking factor(Bfr) Bfr=B/R Number of file blocks(b) b=r/bfr
The hacker group Desdeia tries to break our old weak cipher which we used for the communication with the Duchess of Ligovia. It's generally known that an actual breaking of the cipher needs the reviewing a huge amount of variants which probably lasts a couple of months. Additionally we know that the reviewing of different variants needs always the same server resource. Using our intelligence sources we tried to get some information about the actual progress of breaking, but we got only some fragments: • The hacker group Desdeia uses for breaking their powerful four-core server which resources are fully dedicated to breaking process. . The actual breaking process began exactly at noon, but we don't know, on which day. . By the noon of 2nd of April, already 648,467,673 variants were successfully reviewed. Exactly at this noon, when the breaking process was already lasted for 19 days, it was attempted to double the server speed. The doubling itself was failed, but instead of it there was…
This question concerns block cipher modes. We will use a simple affine cipher, which can be expressed in C as follows. char cipher(unsigned char block, char key) { return (key+11"block)%256; } The inverse of this cipher is shown below. char inv_cipher(unsigned char block, char key) { // 163 is the inverse of 11 mod 256 return (163*(block-key+256))%256; } Note that the block size is 8 bits, which is one byte (and one ASCII character). We will work with the fixed key 0x08. We now decrypt various ciphertexts using modes for this cipher. In every case in which the mode requires an IV, the IV will be OXAA. In the case of CTR mode, we use a (nonce || counter) arrangement in which the nonce is the left 5 bits of OXAA and the counter is a 3 bit counter that begins at 0. In all of the problems given below, one character is one block. Each character of the plaintext should be regarded as its corresponding ASCII code. The ciphertext is given in hexadecimal. a) Decrypt the ciphertext "303…
1. Suppose that a symmetric cryptosystem with a 32-bit key length is used to encrypt messages written in English and encoded in ASCII. Given that keys are short, an attacker is using a brute-force exhaustive search method to decrypt a ciphertext of t bytes. Estimate the probability of uniquely recovering the plaintext corresponding to the ciphertext for the following values of t: 8, 64, 512. 2. Suppose that you are a computer virus writer; hence, you know that you need to store a copy of the code for your virus inside the virus itself. Moreover, suppose you know that a security administrator is also aware of this fact and will be using it to detect the presence of your virus in operating systems files. Explain how you can hide the embedded copy of your virus so that it is difficult for the security administrator to find it.
Suppose Alice and Bob store their RSA public keys in a file on a server. Theycommunicate regularly using authenticated and confidential messages. Eve wants to readthe messages but is unable to crack the RSA private keys of Alice and Bob. However, Eve canbreak into the server and alter the file containing Alice’s and Bob’s public keys.a. How should Eve alter that file so that she can read confidential messages sent fromBob to Alice?b. How might Alice and/or Bob detect Eve’s subversion of the public keys?
Question 4. A sealed-bid auction is a process where a number of partiescalled bidders submit sealed bids for buying some item. Once all sealed bidshave been submitted, the bids are revealed and the highest bidder is the onethat buys the item.Suppose that the following cryptographic primitives are available:• A fully secure public-key encryption scheme (e.g., RSA-OAEP) thatconsists of the key-generation algorithm PKE.Gen, the encryption algorithm Enc, and the decryption algorithm Dec.• An existentially unforgeable digital signature scheme (e.g., RSA-FDH)that consists of the key-generation algorithm DS.Gen, the signing algorithm Sign, and the verification algorithm Vrfy.• A trusted certificate authority (CA) that can be used to issue publickey certificates for any party.Using the cryptographic primitives above, design and analyse an electronic sealed-bid auction protocol according to the following guidelines:• The parties involved in the auction are: (i) an auction administrator(AA) and…
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.