%0 Journal Article
%T Finding passwords by random walks: How long does it take?
%A G. Kabatiansky
%A G. Oshanin
%J Mathematics
%D 2009
%I arXiv
%R 10.1088/1751-8113/42/43/434016
%X We compare an 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.
%U http://arxiv.org/abs/0909.1051v1