Passwords - Brute-Force Method: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
Line 5: | Line 5: | ||
- Delaying password rejection for a few seconds will increase the needed time extremely<br> |
- Delaying password rejection for a few seconds will increase the needed time extremely<br> |
||
'''Solution 2:'''<br> |
'''Solution 2:'''<br> |
||
Allowing only three attempts to login (but enables therefore DoS-Attack)<br> |
- Allowing only three attempts to login (but enables therefore DoS-Attack)<br> |
||
---- |
---- |
Latest revision as of 23:30, 8 November 2004
- Attempt to generate every possible combination of characters and digits
- Leads always to the used password but is a matter of time and compute power
- Total exhaust time is 968 or 252, the average effort for a search is half of this
Solution 1:
- Delaying password rejection for a few seconds will increase the needed time extremely
Solution 2:
- Allowing only three attempts to login (but enables therefore DoS-Attack)
Back (Password Cracking) | Table of Contents | Next (Absolute Limits)