com.nulabinc.zxcvbn.matchers.L33tMatcher Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of zxcvbn Show documentation
This is a java port of zxcvbn, which is a JavaScript password strength generator.
There is a newer version: 1.9.0
package com.nulabinc.zxcvbn.matchers;

import com.nulabinc.zxcvbn.Context;
import com.nulabinc.zxcvbn.WipeableString;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class L33tMatcher extends BaseMatcher {

    private final Map> rankedDictionaries;

    public L33tMatcher(Context context, Map> rankedDictionaries) {
        super(context);
        this.rankedDictionaries = rankedDictionaries;
    }

    private static final Map> L33T_TABLE;

    static {
        Map> l33tTable = new HashMap<>();
        l33tTable.put('a', Arrays.asList('4', '@'));
        l33tTable.put('b', Arrays.asList('8'));
        l33tTable.put('c', Arrays.asList('(', '{', '[', '<'));
        l33tTable.put('e', Arrays.asList('3'));
        l33tTable.put('g', Arrays.asList('6', '9'));
        l33tTable.put('i', Arrays.asList('1', '!', '|'));
        l33tTable.put('l', Arrays.asList('1', '|', '7'));
        l33tTable.put('o', Arrays.asList('0'));
        l33tTable.put('s', Arrays.asList('$', '5'));
        l33tTable.put('t', Arrays.asList('+', '7'));
        l33tTable.put('x', Arrays.asList('%'));
        l33tTable.put('z', Arrays.asList('2'));
        L33T_TABLE = l33tTable;
    }

    public Map> relevantL33tSubTable(CharSequence password) {
        return relevantL33tSubTable(password, L33T_TABLE);
    }

    public Map> relevantL33tSubTable(CharSequence password, Map> table) {
        HashMap passwordChars = new HashMap<>();
        for (int n = 0; n < password.length(); n++) {
            passwordChars.put(password.charAt(n), true);
        }
        Map> subTable = new HashMap<>();
        for (Map.Entry> l33tRowRef : table.entrySet()) {
            Character letter = l33tRowRef.getKey();
            List subs = l33tRowRef.getValue();
            List relevantSubs = new ArrayList<>();
            for (Character sub : subs) {
                if (passwordChars.containsKey(sub)) {
                    relevantSubs.add(sub);
                }
            }
            if (relevantSubs.size() > 0) {
                subTable.put(letter, relevantSubs);
            }
        }
        return subTable;
    }

    @Override
    public List execute(CharSequence password) {
        List matches = new ArrayList<>();
        Map> subTable = relevantL33tSubTable(password);
        L33tSubDict l33tSubs = new L33tSubDict(subTable);
        for (Map sub : l33tSubs) {
            if (sub.isEmpty()) break;
            CharSequence subbedPassword = translate(password, sub);
            for (Match match : new DictionaryMatcher(this.getContext(), rankedDictionaries).execute(subbedPassword)) {
                WipeableString token = WipeableString.copy(password, match.i, match.j + 1);
                WipeableString lower = WipeableString.lowerCase(token);
                if (lower.equals(match.matchedWord)) {
                    token.wipe();
                    lower.wipe();
                    continue;
                }
                Map matchSub = new HashMap<>();
                for (Map.Entry subRef : sub.entrySet()) {
                    Character subbedChr = subRef.getKey();
                    Character chr = subRef.getValue();
                    if (token.indexOf(subbedChr) != -1) {
                        matchSub.put(subbedChr, chr);
                    }
                }
                List subDisplays = new ArrayList<>();
                for (Map.Entry matchSubRef : matchSub.entrySet()) {
                    Character k = matchSubRef.getKey();
                    Character v = matchSubRef.getValue();
                    subDisplays.add(String.format("%s -> %s", k, v));
                }
                String subDisplay = Arrays.toString(subDisplays.toArray(new String[]{}));
                matches.add(MatchFactory.createDictionaryL33tMatch(
                        match.i,
                        match.j,
                        token,
                        match.matchedWord,
                        match.rank,
                        match.dictionaryName,
                        match.reversed,
                        matchSub,
                        subDisplay));
                // Don't wipe token as the Match needs it
                lower.wipe();
            }
        }
        List lst = new ArrayList<>();
        for (Match match : matches) if (match.tokenLength() > 1) lst.add(match);
        return this.sorted(lst);
    }

}