Finding passwords by random walks: How long does it take?

G. Kabatiansky, G. Oshanin

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number434016
JournalJournal of Physics A: Mathematical and Theoretical
Volume42
Issue number43
DOIs
Publication statusPublished - 2009
Externally publishedYes

Fingerprint

Dive into the research topics of 'Finding passwords by random walks: How long does it take?'. Together they form a unique fingerprint.

Cite this