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

DOI10.1088/1751-8113/42/43/434016MaRDI QIDQ3643252zbMATH OpenOpenAlexFDO

Authors

Publication date 10 November 2009

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0909.1051

zbMATH Keywords

lawnmowerrandom search strategies

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Searching and sorting (68P10) Formal languages and automata (68Q45)

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.

Recommendations

• Optimal versus randomized search of fixed length binary words
• Search for the maximum of a random walk
• Search for the maximum of a random walk
• Use of random search in solving discrete extremal problems
• Selecting Secure Passwords

This page was built for publication: Finding passwords by random walks: how long does it take?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643252)