Examining the Strength of Three Word Passwords

William Fraser, Matthew Broadbent, Nikolaos Pitropakis, Christos Chrysoulas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationICT Systems Security and Privacy Protection. SEC 2024
PublisherSpringer
Pages119-133
Number of pages15
ISBN (Electronic)9783031651755
ISBN (Print)9783031651748
DOIs
Publication statusPublished - 26 Jul 2024

Publication series

NameIFIP Advances in Information and Communication Technology
Volume710
ISSN (Print)1868-4238
ISSN (Electronic)1868-422X

Keywords

  • Authentication
  • Entropy
  • Google n-Gram
  • Password

ASJC Scopus subject areas

  • Information Systems and Management

Fingerprint

Dive into the research topics of 'Examining the Strength of Three Word Passwords'. Together they form a unique fingerprint.

Cite this