Examining the Strength of Three Word Passwords

被引:0
作者
Fraser, William [1 ]
Broadbent, Matthew [1 ]
Pitropakis, Nikolaos [1 ]
Chrysoulas, Christos [1 ]
机构
[1] Edinburgh Napier Univ, Edinburgh, Midlothian, Scotland
来源
ICT SYSTEMS SECURITY AND PRIVACY PROTECTION, SEC 2024 | 2024年 / 710卷
关键词
Authentication; Password; Entropy; Google n-Gram;
D O I
10.1007/978-3-031-65175-5_9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Passwords make up the most common method of authentication. With ever increasing computing power, password complexity has had to keep pace. This creates a challenge for remembering all complex passwords which some password policies attempt to resolve. One such policy is to use three random words rather than a complex alphanumeric password. This paper attempted to prove the security of using such three-word passwords. It was discovered both theoretically and experimentally that three-word passwords should not be considered secure. Theoretical entropy of a three-word password found in the 25,000 most common words would be 43.8, that is lower than the entropy of a lowercase only password. Experimental data, collected via participant survey, shows up to 85% of random words provided by participants could be found in the top 15,000 common words found in the Google n-Gram data and 86.47% of combinations could be found in 25,000 most common words. This would mean, for at least 86.47% of cases, the entropy of the password is less than passwords already considered insecure in the industry.
引用
收藏
页码:119 / 133
页数:15
相关论文
共 15 条
  • [1] Think Harder! Investigating the Effect of Password Strength on Cognitive Load during Password Creation
    Abdrabou, Yasmeen
    Abdelrahman, Yomna
    Khamis, Mohamed
    Alt, Florian
    [J]. EXTENDED ABSTRACTS OF THE 2021 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS (CHI'21), 2021,
  • [2] Barber R., 2001, Network Security, P9
  • [3] On the Economics of Offline Password Cracking
    Blocki, Jeremiah
    Harsha, Ben
    Zhou, Samson
    [J]. 2018 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP), 2018, : 853 - 871
  • [4] Bosker B., Google database tracks popularity of 500 billion words
  • [5] Burr WilliamE., 2004, Nist special publication 800-63. Electronic Authentication Guideline,? Version
  • [6] Ertaul Levent., 2016, Proceedings of the International Conference on Wireless Networks, P66
  • [7] Heid K., 2023, P 9 INT C INFORM SYS, P38
  • [8] Characterizing the Google Books Corpus: Strong Limits to Inferences of Socio-Cultural and Linguistic Evolution
    Pechenick, Eitan Adam
    Danforth, Christopher M.
    Dodds, Peter Sheridan
    [J]. PLOS ONE, 2015, 10 (10):
  • [9] Pinkas B., 2002, P 9 ACM C COMP COMM, DOI DOI 10.1145/586110.586133
  • [10] Skiena S.S., 2012, The Algorithm Design Manual, V2nd ed., DOI [DOI 10.1007/978-1-84800-070-4, 10.1007/978-1-84800-070-4]