Based on the previous question (UNIX passwords are derived by encrypting a public salt 1000 times with the password). Assume that passwords are limited to the use of the 52 English letters (both lower and upper cases) and that all passwords are 6 characters in length. Assume a password cracker capable of doing 6 million encryptions per second. How long will it take to crack a password with brute-force on a UNIX system, on average? (answer is an integer, the unit must be in seconds)

Based on the previous question (UNIX passwords are derived by encrypting a public salt 1000 times with the password). Assume that passwords are limited to the use of the 52 English letters (both lower and upper cases) and that all passwords are 6 characters in length. Assume a password cracker capable of doing 6 million encryptions per second. How long will it take to crack a password with brute-force on a UNIX system, on average? (answer is an integer, the unit must be in seconds)

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

Related questions

Q: Suppose we will use Advanced Encryption Standard (AES) to encrypt a block of plaintext and the known…

A: Introduction

Q: Exercise 2 (MAC schemes derived from block ciphers ( Let E denote the family of encryption functions…

A: we assume that it is not collision resistant, i.e. we can find a pain of messages x and y where xty…

Q: Suppose the password file of a system is available to a hacker. How much extra time does the hacker…

A: The Morris-Thompson protection scheme is the technique that adds an extra layer of protection to…

Q: A password generator creates a 10-character case-sensitive alphanumeric (a-zA-Z0-9) password keyed…

A: How many passwords are possible, average length of time be for a successful brute force attack if…

Q: Construct an experiment to estimate the speed at which a particular computer can process an…

A: The answer for the given question is as follows

Q: We know that RSA works with numbers. Assume we want to encrypt the plaintext M=“ComputerSecurity”.…

A: RSA encryption includes utilizing a public key (e, N) to encrypt a message M, coming about in the…

Q: Suppose we are using a method of encryption that does as much as possible to hide any patterns of a…

A: - The queston wants to know what is better, encryption before compression or compression before…

Q: Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzl.…

A: According to the information given:- we have to follow the instruction in order to get the tap bits…

Q: capturing directory accesses, you are provided two bits. In what ways would you make use of the four…

A: The way we would make use of the four operations in disposal.

Q: Give an illustration of a made-up scenario requiring the management of login credentials, for…

A: Identify authentication methods. Passwords: obsolescent?Password authentication affects customer…

Q: uppose a plaintext message is encrypted using the Caesar cipher b=a+26 10 here each letter of the…

A: Given decrypted message is WKDR SC MYYV (which is encrypted with a+10 mod 26) In order to get the…

Q: Consider the following encryption scheme for a block cipher (using the notation frequently used in…

A: Cipher Block Chaining : CBC is a headway made on ECB since ECB bargains some security necessities.…

Q: What is the maximum amount of time that it would take a computer that can test keys per second to…

A: The only known practical attack on AES-256, when used in the way that ScramBox does, is called a…

Q: Now assume that the user used only 34 characters from the keyboard. What is the key length in bits…

A: 1. Keyspace Size for 6-Character ASCII Password Keyspace Size Calculation: If each character can be…

Q: # A password generator creates a 10-character case-sensitive alphanumeric (a-zA-Z0-9) password keyed…

Q: Suppose a programmer is functionally decomposing a two-factor authentication process. Which step…

A: Two-factor authentication (2FA) is a security process that enhances the authentication of users by…

Q: Note: The notation from this problem is from Understanding Cryptography by Paar and Pelzi. Consider…

A: LFSR is a Linear Feedback Shift Register. Its input bits are usually driven by the XOR gates. In…

Question

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Similar questions

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…
The definition of a Shift Cipher can be expressed as follows:Def. Let x, y, k ∈ Z26 with the encryption operation as ek(x) ≡ x + k mod 26 and thedecryption operation as dk(y) ≡ y - k mod 26.Given the provided letter encoding, what would be the encoding of the plaintext word ATTACKafter applying a shift cipher with a k=17?
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).
The operator of a Vigenere encryption machine is bored and encrypts a plaintext consisting of the same letter of the alphabet repeated several hundred times. The key is a seven-letter English word. Eve knows that the key is a word but does not yet know its length. What property of the ciphertext will make Eve suspect that the plaintext is one repeated letter and will allow her to guess that the key length is seven? What will the number of matches be for the different displacements?
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?
Question 8 please do not use a computer system generater I need to see how it's done
In an RSA system, the public key (n,e) of a given user is (323, 11). 1. What is the value of the exponent in the private key (n, d), of this user? 2. Suppose you want to send this user the message m = 45, write down the expression to generate the ciphertext for this message. 3. Suppose that your ciphertext, c, is 5, write down the expression to generate the plaintext matching this ciphertext. 4. Can you encrypt the message m=322 with this public key? O a. Yes O b. No
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…