Data::Password::zxcvbn::Match::Sequence(3pm)

Data::Password::zxcvbn::Match::Sequence3pm

Match class for sequences of uniformly-spaced codepoints

Version

version 1.1.2

Overview

This class represents the guess that a certain substring of a password, consisting of uniformly-spaced codepoints, is easy to guess.

Attributes

"ascending"

Boolean, true if the sequence starts at a lower codepoint and ends at a higher one (e.g. "acegi" is ascending, 86420 is not).

Methods

"estimate_guesses"

The number of guesses is linear with the length of the sequence. Descending sequences get a higher estimate, sequences that start at obvious points (e.g. "A" or 1) get lower estimates.

"feedback_warning"

"feedback_suggestions"

This class suggests not using sequences.

"make"

  my @matches = @{ Data::Password::zxcvbn::Match::Sequence->make(
    $password,
  ) };

Scans the $password for sequences of characters whose codepoints increase or decrease by a constant.

"fields_for_json"

The JSON serialisation for matches of this class will contain "token i j guesses guesses_log10 ascending".

Releases

3 releases since Debian 11 (Bullseye); the text changed 1 time.

  1. 11
  2. 12–13

Author

Gianni Ceccarelli <[email protected]>

From libdata-password-zxcvbn-perl 1.1.2-1 in Debian 13 (Trixie). Parsed by carta from the page's man source.