{"paper":{"title":"Finding passwords by random walks: How long does it take?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.other","cs.DS","math.PR"],"primary_cat":"cs.CR","authors_text":"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, Paris, Russia, University Pierre & Marie Curie","submitted_at":"2009-09-05T19:25:35Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.1051","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}