Probability of guessing a password

  • Thread starter Thread starter alman9898
  • Start date Start date
  • Tags Tags
    Probability
AI Thread Summary
The discussion focuses on calculating the probability of a hacker successfully guessing a password consisting of two lowercase letters within five attempts. The initial assumption was that the hacker guesses without replacement, but the teacher clarified that attempts should be treated as independent. The probability of success on a single guess is 1/(26*26), and the total probability of success across five independent attempts can be modeled using a geometric distribution. The correct approach involves calculating the probability of failure for all five attempts and then deriving the success probability from that. Ultimately, the consensus is to compute the odds of getting it right on the first try and multiply by five for the total probability of success.
alman9898
Messages
9
Reaction score
0

Homework Statement


Consider a simple password scheme using only two lowercase letters. A hacker is given 5 chances to guess the pw before being detected. Computer probability hacker is successful.


Homework Equations


p = 1/(26*26)


The Attempt at a Solution



I'm assuming the hacker isn't guessing randomly, but without replacement.

I feel that I may be multiplying the wrong probabilities, but what the heck:

P(attacker is successful) = \frac{1}{26^{2}} + \frac{1}{26^{2}*(26^{2}-1)} + \frac{1}{26^{2}*(26^{2}-1)*(26^{2}-2)} + \frac{1}{26^{2}*(26^{2}-1)*(26^{2}-2)*(26^{2}-3)} + \frac{1}{26^{2}*(26^{2}-1)*(26^{2}-2)*(26^{2}-3)*(26^{2}-4)}

This was an intuitive guess, since each guess is equally likely, I just subtract one from the sample space for each of the five guesses.
 
Physics news on Phys.org
There are 26*26 possible passwords. Only one of them is correct. The hacker gets 5 chances. So, yes, the hacker will pick 5 different possibilities of that group of 26*26 passwords. You are way overthinking this problem.
 
Wait, what? I don't think 5/(26*26) would be the right answer, since that implies there is a 5 in 26^2 chance that they get the answer right on the first try...

My teacher has since told me to assume the attempts are independent (dumb hacker, I guess) so I'm modeling this as a geometric distribution with p = 1/(26*26). The total probability will be the probability hacker is successful in one try, two tries, three, four, or five tries all summed up. Does that sound right?
 
alman9898 said:
Wait, what? I don't think 5/(26*26) would be the right answer, since that implies there is a 5 in 26^2 chance that they get the answer right on the first try...

My teacher has since told me to assume the attempts are independent (dumb hacker, I guess) so I'm modeling this as a geometric distribution with p = 1/(26*26). The total probability will be the probability hacker is successful in one try, two tries, three, four, or five tries all summed up. Does that sound right?

Or do you actually mean the tries are TRULY independent? I.e. he forgets which passwords he's tried before? Oh, I'll bet you do, sorry. Then you can treat the problem more easily by computing the odds the hacker will fail. He needs to guess the wrong password five times in a row.
 
For this problem, the wisest way to go about it is the way that you said. Think about it this way. If it is independent and the hacker may or may not retry the same password. One must compute the odds that the hacker will get it right on his first try. That means 1/(26*26). Once we get this we multiply this by five. That will give you the correct answer.
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...

Similar threads

Back
Top