论文标题
多臂强盗方法密码猜测
Multi-armed bandit approach to password guessing
论文作者
论文摘要
多臂强盗是赌徒面对许多不同机器（匪徒）时面临的问题的数学解释。赌徒想探索不同的机器，以发现哪台机器提供了最佳的奖励，但同时想利用最有利可图的机器。密码猜测者面临着类似的困境。他们包含泄漏的密码集，单词字典和有关用户的人口统计信息的列表，但他们不知道哪个字典将获得最佳的奖励。在本文中，我们提供了一个在密码猜测的上下文中使用多臂强盗问题的框架，并使用一些示例表明它可以有效。
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.
