Answered step by step
Verified Expert Solution
Question
1 Approved Answer
1 . Suppose there are 1 0 0 0 users, and an attacker has a dictionary of 5 0 0 0 common passwords. An attacker
Suppose there are users, and an attacker has a dictionary of common passwords. An attacker has stolen the database of hashed passwords.
a If the users password in the database were hashed without salt, how many Hash computation does the attacker need to find all users that have the passwords in the dictionary?
b Calculate the number of Hash computations again, now assuming salt is used for the hash.
Show you computation steps and give necessary explanations to get full credit.
In class authentication we explained storing Hashpassword as one way to make the guessing work expensive While doing this indeed slows down the attackers offline password guessing attempt, it also significantly increases the servers effort. Suppose the server still stores Hashpassword but when Alice logs in her client machine first computes Hashpassword and sends that to the server.
a Will there still be the advantage gained by storing Hashpassword
b Will this save the server computation?
To answer both questions, first clearly give a YesNo and then use a few sentences to explain why you make this conclusion.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started