Suppose an offline dictionary attack is used, and suppose the attacker has prepared a dictionary of 1000 entries, the password file contains 500 users ' hashed passwords with 500 different salt values(Salt values correlation to user accounts is unknown to the attacker). If the attacker's goal is to crack as many passwords as possible. Calculate how many hash values would the attacker compute in the worst case (final answer)? Answer:

Suppose an offline dictionary attack is used, and suppose the attacker has prepared a dictionary of 1000 entries, the password file contains 500 users ' hashed passwords with 500 different salt values(Salt values correlation to user accounts is unknown to the attacker). If the attacker's goal is to crack as many passwords as possible. Calculate how many hash values would the attacker compute in the worst case (final answer)? Answer:

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

1- Consider password authentication :(a) Suppose an off-line dictionary attack is used, and suppose the attacker has prepared a dictionaryof 10,0000 entries, the password file contains 1000 users with 50 different salt values(Salt valuescorrelation to user accounts attackers is unknown to the attacker). If the attacker’s goal is to get asmany passwords as possible, how many hash values would the attacker compute in the worst case?(b) Based on the above part, how many comparisons between hash values are needed in the worse case? 2- A Digital Certificate usually contains an identity and other fields such as certificate issuer’sname .. etc :(a) Explain the process for a service owner (i.e. web application) to get a Digital Certificate ?(b) How does the Digital Certificate issued in part(a) enable any end user to detect the man in themiddle attack?(c) What is the impact on the validity of the Digital Certificate if the hash algorithm used is not weakcollision resistant? Justify your answer…
Rainbow tables contains precomputed hashed passwords that allow an attacker to quickly locate the hash of a user’s password in the tables to relate this to the original text password. Group of answer choices True False
Find the danger in each authentication method and explain how to deal with it.Bob uses a hashing algorithm to compare a password to a collection of previously hashed passwords.Bob uses a database of previously hashed passwords to check the strength of a given password.
Identify the vulnerabilities associated with each authentication technique and provide a fix for the issue at hand.Bob generates a hash of a password and compares it to a repository of hashes.Bob uses a hashing method to verify a password against a list of previously hashed passwords.
What about encrypting an AES key with a secret password? Make a case for why your answer is correct.Look at the keyed hash function as an alternative to the hash function. Check out a sample hash function with a single key.
What is the concept of "salting" in the realm of password hashing, and why is it important?
For each kind of authentication, explain the danger and provide a countermeasure.Bob uses a hashing algorithm to check a password against a collection of previously hashed passwords.Bob uses a database of double-hashed hashes to check a user's password against their own.
How about encrypting an AES key using a secret password? Extend your justification for why you chose that particular answerKeyed hash functions are compared to hash functions. Check out a sample of a hash function with a single key.
Is it possible to encrypt an AES key using a shared secret? Justify your answer Consider the hash function in comparison to the keyed hash function. Consider an example of a one-keyed hash function.
Find the danger in each authentication method and explain how to deal with it.Bob uses a hashing algorithm to check if a password is correct against a collection of previously hashed passwords.In order to determine whether or not a password is secure, Bob hashes it twice and checks it against a database of other hashed passwords.
What role do salting and iterative hashing play in password security?
Hash chains and rainbow tables are used to recover hashed passwords. Outline similarities and differences between both concepts and give a comprehensive example of how a hashed password can be recovered by a rainbow table.