| |
Hi there!
Excuse me if i am totally lost here...
Is it not so that a 6 letter password containing letters from A to Z and 0
to 9, can have 36^6 different combinations and contains 48 bits in a unique
order?
A binary value containing 0 or 1 in 8 postitions is 2^8, equals 256
/Joakim
"Todd Lehman" <lehman@javanet.com> wrote in message
news:G1FIsA.Etr@lugnet.com...
> I'm not sure if I'm remembering the figures exactly, but IIRC it currently
> passes 6-character pw's containing an average of approximately 24-26 bits • of
> unique information. To make pw's more "practical" would mean dropping • that
> even further (26 is already somewhat risky) down to something like • probably
> 18. Even 2^20 is only one million, and 2^18 is only 1/4 million. If • someone
> ran one innocuous HTTP request per second, it would take less than a week • to
> make 2^18 attempts in that more relaxed pw validation scenario.
>
> 2^18 is open net hockey for crackers.
>
> --Todd
|
|
Message has 1 Reply:
 | | Re: LUGNET Memberships
|
| (...) 36^6 is about equal to 2^31. Maybe it was typical 5-character pw's that resulted in 24-26 bits of true information...I don't remember for sure, it was many months ago. OK, yes, <calculator poking> 36^5 is about equal to 2^26. Also, IIRC, I (...) (24 years ago, 25-Sep-00, to lugnet.people, lugnet.admin.general)
|
Message is in Reply To:
| | Re: LUGNET Memberships
|
| (...) ouch. How easy is it for a thief to get your customer number? How many digits is your PIN? (...) natch. :) (...) Disable accounts on repeated fails and you make it trivial to DoS someone. Disable IP addresses and you lock out the innocent on (...) (24 years ago, 25-Sep-00, to lugnet.people, lugnet.admin.general)
|
113 Messages in This Thread:
(Inline display suppressed due to large size. Click Dots below to view.)
- Entire Thread on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
This Message and its Replies on One Page:
- Nested:
All | Brief | Compact | Dots
Linear:
All | Brief | Compact
|
|
|
|
