UNDERLINED SPOTS ARE WHERE ANSWERS GO Please help with this problem someone, I a
ID: 643600 • Letter: U
Question
UNDERLINED SPOTS ARE WHERE ANSWERS GO
Please help with this problem someone, I am confused and have no idea how to do it. I found afew solutions on the web but I'm not sure about the final answers.
Assume that passwords are selected from four-character combinations of 26 alphabetic characters. Assume that an adversary is able to attempt passwords at rate one per second.
1. Assuming no feedback to the adversary until each attempt has been completed, what is the maximum number of attempts needed to recover a password?
________^ _____ possible combos = _________
2. Assuming that an adversary gets to know each incorrect character that is entered, what is the expected time to discover the correct password? Example: assume the password is CATS. The attacker tries A, and knows it is wrong (the attacker gets feedback). Then, the attacker tries B, and it is wrong. C, and it comes to know that it is correct (again, the attacker gets feedback at each attempt)! Then the attacker tries A: correct! etc... Think about the max number of attempts the attacker needs to try for every character in the password [recall each password is long 4]...
max: ____________* ___________ = therefore the mean average = ______________ sec.
UNDERLINED SPOTS ARE WHERE ANSWERS GO
Please help with this problem someone, I am confused and have no idea how to do it. I found afew solutions on the web but I'm not sure about the final answers.
Assume that passwords are selected from four-character combinations of 26 alphabetic characters. Assume that an adversary is able to attempt passwords at rate one per second.
1. Assuming no feedback to the adversary until each attempt has been completed, what is the maximum number of attempts needed to recover a password?
________^ _____ possible combos = _________
2. Assuming that an adversary gets to know each incorrect character that is entered, what is the expected time to discover the correct password? Example: assume the password is CATS. The attacker tries A, and knows it is wrong (the attacker gets feedback). Then, the attacker tries B, and it is wrong. C, and it comes to know that it is correct (again, the attacker gets feedback at each attempt)! Then the attacker tries A: correct! etc... Think about the max number of attempts the attacker needs to try for every character in the password [recall each password is long 4]...
max: ____________* ___________ = therefore the mean average = ______________ sec.
Explanation / Answer
1.T=264/2seconds = 63.5 hours
2.Expect 13 tries for each digit. T = 13 4 = 52 seconds.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.