Re:United declares 4-digit pin login and lack of SSL “functi...
by UnoriginalGuy on Sunday July 05, 2015 @10:37PM
(#9836382)
To be honest both the email and tweet read like someone trying very very hard to sound smart. They're over-using concepts that don't help clarify the issue, so the only reason I can assume they even included that was so that we knew they knew that those concepts existed.
Re:United declares 4-digit pin login and lack of SSL “functi...
by blintzing on Sunday July 05, 2015 @10:44PM
(#9836405)
Is he perhaps joking? Even a brief read of the Wikipedia article makes it clear that NP-hard isn't a mathematical expression in which 'N' stands for a number...
Re:United declares 4-digit pin login and lack of SSL “functi...
by UnoriginalGuy on Sunday July 05, 2015 @10:54PM
(#9836454)
He could be in the tweet (giving the benefit of the doubt), but there's no way he is in the email reading it in context.
Re:United declares 4-digit pin login and lack of SSL “functi...
by Dylan16807 on Monday July 06, 2015 @12:07AM
(#9836714)
Yes, it's a different N. He didn't say or imply they were the same N. It makes perfect sense to talk about the size parameter when discussing complexity.
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.
FYI, the "N" in "NP hard" is not a number. It stands for nondeterministic. The mention of "NP hard" in the first place just seems...unnecessary.