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

2); (2) Laboratory J.-V. Poncelet; 3) ((1) Dobrushin Mathematical Laboratory; (3) LPTMC; France); G. Kabatiansky (1; G.Oshanin (2; Independent University of Moscow; Institute of Information Transmission Problems; Moscow

arxiv: 0909.1051 · v1 · pith:WGFMUUS3new · submitted 2009-09-05 · 💻 cs.CR · cond-mat.other· cs.DS· math.PR

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

G. Kabatiansky (1 , 2) , G.Oshanin (2 , 3) ((1) Dobrushin Mathematical Laboratory , Institute of Information Transmission Problems , Moscow , Russia , (2) Laboratory J.-V. Poncelet

show 5 more authors

Independent University of Moscow (3) LPTMC University Pierre & Marie Curie Paris France)

This is my paper

classification 💻 cs.CR cond-mat.othercs.DSmath.PR

keywords randomsearchfindinglawnmowerlettersalphabetbestcompare

0 comments

read the original abstract

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.

This paper has not been read by Pith yet.

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

discussion (0)