A Large-scale Analysis of the Mnemonic Password Advice

被引:10
|
作者
Kiesel, Johannes [1 ]
Stein, Benno [1 ]
Lucks, Stefan [1 ]
机构
[1] Bauhaus Univ Weimar, Weimar, Germany
来源
24TH ANNUAL NETWORK AND DISTRIBUTED SYSTEM SECURITY SYMPOSIUM (NDSS 2017) | 2017年
关键词
SECURITY;
D O I
10.14722/ndss.2017.23077
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
How to choose a strong but still easily memorable password? An often recommended advice is to memorize a random sentence (the mnemonic) and to concatenate the words' initials: a so-called mnemonic password. The paper in hand analyzes the effectiveness of this advice-in terms of the obtained password strength-and sheds light on various related aspects. While it is infeasible to obtain a sufficiently large sample of human-chosen mnemonics, the password strength depends only on the distribution of certain character probabilities. We provide several pieces of evidence that these character probabilities are approximately the same for human-chosen mnemonics and sentences from a web crawl and exploit this connection for our analyses. The presented analyses are independent of cracking software, avoid privacy concerns, and allow full control over the details of how passwords are generated from sentences. In particular, the paper introduces the following original research contributions: (1) construction of one of the largest corpora of human-chosen mnemonics, (2) construction of two web sentence corpora from the 273 TB ClueWeb12 web crawl, (3) demonstration of the suitability of web sentences as substitutes for mnemonics in password strength analyses, (4) improved estimation of password probabilities by position-dependent language models, and (5) analysis of the obtained password strength using web sentence samples of different sentence complexity and using 18 generation rules for mnemonic password construction. Our findings include both expected and less expected results, among others: mnemonic passwords from lowercase letters only provide comparable strength to mnemonic passwords that exploit the 7-bit visible ASCII character set, less complex mnemonics reduce password strength in offline scenarios by less than expected, and longer mnemonic passwords provide more security in an offline but not necessarily in an online scenario. When compared to passwords generated by uniform sampling from a dictionary, distributions of mnemonic passwords can reach the same strength against offline attacks with less characters.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] On the analysis of large-scale genomic structures
    Nestor Norio Oiwa
    Carla Goldman
    Cell Biochemistry and Biophysics, 2005, 42 : 145 - 165
  • [22] Large-Scale Visual Data Analysis
    Johnson, Chris
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2012, : 1 - 1
  • [23] Large-scale functional analysis of proteins
    不详
    CHEMICAL & ENGINEERING NEWS, 2000, 78 (47) : 41 - 41
  • [24] Large-Scale Web Data Analysis
    Leskovec, Jure
    IEEE INTELLIGENT SYSTEMS, 2011, 26 (01) : 11 - 11
  • [25] Large-Scale Analysis of Art Proportions
    Jensen, Kristoffer
    ARTS AND TECHNOLOGY, 2015, 145 : 137 - 143
  • [26] Large-scale parametric survival analysis
    Mittal, Sushil
    Madigan, David
    Cheng, Jerry Q.
    Burd, Randall S.
    STATISTICS IN MEDICINE, 2013, 32 (23) : 3955 - 3971
  • [27] On the analysis of large-scale genomic structures
    Oiwa, NN
    Goldman, C
    CELL BIOCHEMISTRY AND BIOPHYSICS, 2005, 42 (02) : 145 - 165
  • [28] LIKELIHOOD ANALYSIS OF LARGE-SCALE FLOWS
    JAFFE, AH
    KAISER, N
    ASTROPHYSICAL JOURNAL, 1995, 455 (01): : 26 - 31
  • [29] Incremental Large-Scale Electrostatic Analysis
    Ye, Zuochang
    Zhu, Zhenhai
    Phillips, Joel R.
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2009, 28 (11) : 1641 - 1653
  • [30] ANALYSIS OF THE LARGE-SCALE STRUCTURE OF THE UNIVERSE
    DOROSHKEVICH, AG
    KOTOK, EV
    SHANDARIN, SF
    SIGOV, YS
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 1983, 202 (02) : 537 - 552