Passwords - Password Retry Counters

Revision as of 23:53, 8 November 2004 by Schumann (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

- Failure by proving passwords letter by letter
- On PDP-10 Tenex OS
- Opens timing attack
- Instead of (A^N)/2 it only takes A^(N/2) (A = alphabet of characters, N = number of characters used for the password)

Back (The Need for Trusted Path) | Table of Contents | Next (Attacks on Password Storage)