Expectation Entropy as a Password Strength Metric

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Reaz, Khan, Wunder, Gerhard
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910424021073920
author Reaz, Khan
Wunder, Gerhard
author_facet Reaz, Khan
Wunder, Gerhard
contents The classical combinatorics-based password strength formula provides a result in tens of bits, whereas the NIST Entropy Estimation Suite give a result between 0 and 1 for Min-entropy. In this work, we present a newly developed metric -- Expectation entropy that can be applied to estimate the strength of any random or random-like password. Expectation entropy provides the strength of a password on the same scale as an entropy estimation tool. Having an 'Expectation entropy' of a certain value, for example, 0.4 means that an attacker has to exhaustively search at least 40\% of the total number of guesses to find the password.
format Preprint
id arxiv_https___arxiv_org_abs_2404_16853
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Expectation Entropy as a Password Strength Metric
Reaz, Khan
Wunder, Gerhard
Cryptography and Security
The classical combinatorics-based password strength formula provides a result in tens of bits, whereas the NIST Entropy Estimation Suite give a result between 0 and 1 for Min-entropy. In this work, we present a newly developed metric -- Expectation entropy that can be applied to estimate the strength of any random or random-like password. Expectation entropy provides the strength of a password on the same scale as an entropy estimation tool. Having an 'Expectation entropy' of a certain value, for example, 0.4 means that an attacker has to exhaustively search at least 40\% of the total number of guesses to find the password.
title Expectation Entropy as a Password Strength Metric
topic Cryptography and Security
url https://arxiv.org/abs/2404.16853