Assume passwords are chosen from a set of 26 alphabetic character combinations of four characters each. Assume that an attacker can attempt passwords at a pace of one per second. a. Assuming no input to the adversary until each attempt is finished, how long should it take to find the right password? b. Assuming the adversary receives feedback indicating an error for each wrong character submitted, what is the estimated time to find the right password?

Assume passwords are chosen from a set of 26 alphabetic character combinations of four characters each. Assume that an attacker can attempt passwords at a pace of one per second. a. Assuming no input to the adversary until each attempt is finished, how long should it take to find the right password? b. Assuming the adversary receives feedback indicating an error for each wrong character submitted, what is the estimated time to find the right password?

Management Of Information Security

6th Edition

ISBN:9781337405713

Author:WHITMAN, Michael.

Publisher:WHITMAN, Michael.

Chapter12: Protection Mechanisms

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

Assume passwords are selected from four-character combinations of 26 alphabetic characters. Assume an adversary is able to attempt passwords at a rate of one per second. a. Assuming no feedback to the adversary until each attempt has been completed, what is the expected time to discover the correct password b. Assuming feedback to the adversary flagging an error as each incorrect character is entered, what is the expected time to discover the correct password?
3. Password authentication questions a. Using an alphabet consisting of 62 characters and a password length of 8 characters, how many different passwords are possible? b. If a brute force attack is being used to attack a password system from an alphabet of 62 characters, and it takes 1 second to test each password, how long does the password have to be so that it takes 1000 days to guess any password
A software is used to calculate the number of integers ranging from 1 to 10. The software is developed by a programmer who understands reusability and maintainability, and it counts the numbers from k to n. In contrast, a team of security specialists analyzes the code. The team verifies that this software properly sets k to 1 and n to 10; as a consequence, the program is certified as sufficiently restricted to operate only within the range of 1 to 10. List numerous methods to sabotage this program so that it computes a certain number, such as 3 to 20, during operation.
Consider yourself the Authentication Manager of an IT organization, and you see that things were done haphazardly in the past. Users may select from a set of 62 characters (lower/upper case alphabets and 10 numbers) for the password setup, and a password length of ten characters was specified. Consider a strong adversary that can guess 10,000 passwords in a single second. Calculate the likelihood that a password in your company will be properly guessed by an attacker in a one-year period for password lengths of 12, 14, and 16. Users may still select just 62 characters.
Write a brute force algorithm to crack a 4-digit password. Explain the steps to develop your algorithm (input, output, paragraph about the design). What is the complexity of your algorithm?
Make a case for a certain historical period as the beginning point for the word "safe." Assume an intruder wants to use a brute force assault to break a password. What value of x (total time needed to test all potential passwords) does the intruder regard this attack to be unreasonably long?
When authentication requires more than one piece of information (factor), we call this,... Group of answer choices Factor authentication Single factor authentication Multifactor authentication Many factor authentication
Consider a situation that necessitates the handling of login credentials and make intelligent predictions. Create a list of all the methods in which you have been able to confirm your identity to date. Do you anticipate the elimination of passwords in the near future?
An imaginary situation involving inauthentic login management must be described. Several different verification strategies exist. Has the number of people who use passwords decreased?
Concoct a made-up situation involving the administration of logins, and explain it in great detail. Consider a number of different authentication approaches. It is still essential to have a login and password, but is this practice becoming less common?
Respond to the following in a minimum of 175 words: Discuss a cryptography attack scenario. Choose an attack and explain how it works. Be sure to choose one that hasn’t been mentioned by another classmate. What countermeasures would you apply? How do the countermeasures you would use compare to those your classmates recommended for the attacks they chose? What do those similarities or differences tell you about fighting these types of attacks?
1. Recall the concept of security level for a cryptosystem. We say that a system provides i bits of security, if the best known attack against the system takes O(2^) operations. The integer A is sometimes called the security parameter. Explain why the key sizes of some cryptosystems are significantly larger than their security parameters.