Finding passwords by random walks: how long does it take?
We compare the efficiency of a deterministic 'lawnmower' and random search strategies for finding a prescribed sequence of letters (a password) of length M in which all letters are taken from the same Q-ary alphabet. We show that, at best, a random search takes two times longer than a ...
Gespeichert in:
| Veröffentlicht in: | Journal of physics. A, Mathematical and theoretical Mathematical and theoretical, 2009-10, Vol.42 (43), p.434016-434016 (6), Article 434016 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We compare the efficiency of a deterministic 'lawnmower' and random search strategies for finding a prescribed sequence of letters (a password) of length M in which all letters are taken from the same Q-ary alphabet. We show that, at best, a random search takes two times longer than a 'lawnmower'search. |
|---|---|
| ISSN: | 1751-8121 1751-8113 1751-8121 |
| DOI: | 10.1088/1751-8113/42/43/434016 |