The multi-armed bandit is a mathematical interpretation of the problem a gambler faces when confronted with a number of different machines (bandits). The gambler wants to explore different machines to discover which machine offers the best rewards, but simultaneously wants to exploit the most profitable machine. A password guesser is faced with a similar dilemma. They have lists of leaked password sets, dictionaries of words, and demographic information about the users, but they don't know which dictionary will reap the best rewards. In this paper we provide a framework for using the multi-armed bandit problem in the context of the password guesser and use some examples to show that it can be effective.
翻译:多武装土匪是对问题的一种数学解释,赌徒面对的是不同的机器(土匪)。赌徒想要探索不同的机器来发现哪个机器能带来最佳回报,但同时也想要利用最有利可图的机器。密码猜测者面临类似的困境。他们有泄露的密码套、词典和用户人口信息清单,但他们不知道哪本字典将获得最佳回报。在本文中,我们为在密码猜测者的背景下使用多武装土匪问题提供了一个框架,并用一些例子来表明它可能有效。