News for hackers. Stuff that matters.
Re:United declares 4-digit pin login and lack of SSL “functi... by mmarx on Sunday July 05, 2015 @11:56PM (#9836669)
> The mention of "NP hard" in the first place just seems...unnecessary.

Furthermore, trying all possible passwords of length n for a fixed alphabet can be done in polynomial time, hence finding the password deterministically only takes polynomial time. Thus, it's only NP-hard if P=NP.

Edit: You're right, I mixed up length and size of the alphabet, so disregard that comment. I probably should go to sleep.

Re:United declares 4-digit pin login and lack of SSL “functi... by Dylan16807 on Monday July 06, 2015 @12:00AM (#9836683)
k^n is exponential, not polynomial.