Package org.owasp.passfault

Examples of org.owasp.passfault.PasswordPattern

164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
      if (ithPatterns != null) {
        PathCost pathCost = ithSmallestCost(ithPatterns);
        counter++;

        //random characters between startChar and the next found pattern
        PasswordPattern randomPattern = getRandomPattern(startChar, i);

        if (randomPattern != null) {
          pathCost.addPattern(randomPattern);
        }
        if (pathCost.getRelativeCost() < smallestCost) {
          smallestCost = pathCost.getRelativeCost();
          smallestCostPath = pathCost;
        }
      }
    }
    if (smallestCostPath.getPath().size() == 0) {
      PasswordPattern randomPattern = getRandomPattern(startChar, password.length());
      if (randomPattern != null) {
        smallestCostPath.addPattern(randomPattern);
      }
    }
    return smallestCostPath;
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
      //report every sequence from the first type to the current index
      for(int i=start; i <= start + countOfType - threshold; i++){
        CharSequence chars = pass.getCharSequence().subSequence(i, currentIndex+1);
        double size = Math.pow(type.getSize(),  countOfType);
       
        PasswordPattern pattern = new PasswordPattern(
            i, chars.length(), chars, size,
            "Random Characters with:" + type.name(), RandomPattern.RANDOM_PATTERN, type.name());
        pass.foundPattern(pattern);
      }
    }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
        int start = matcher.start();
        int end = matcher.end();
        int length = end-start;
        CharSequence matchString = chars.subSequence(start, end);

        pass.foundPattern(new PasswordPattern(
            start, length, matchString, dateSize, "Date Format", DATE_PATTERN, null));
      }
    } while (found);
  }
View Full Code Here
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
  public PathCost process(PathCost cost, PasswordResults password) {
    PathCost newPath = new PathCost(password);
    List<PasswordPattern> path = cost.getPath();
    for (int len = path.size() - 1, i = len; i >= 0; i--) {
      PasswordPattern pass = path.get(i);
      boolean foundDuplicate = false;
      for (int j = i - 1; j >= 0; j--) {
        PasswordPattern toCompare = path.get(j);
        if (!toCompare.getName().equals(RandomPattern.RANDOM_PATTERN)
            && toCompare.getName().equals(pass.getName())
            && toCompare.getMatchString().equals(pass.getMatchString())) {
          //repeated-duplicate pattern instance
          foundDuplicate = true;
          break;
        }
      }
      if (foundDuplicate) {
        PasswordPattern dupp = new PasswordPattern(pass.getStartIndex(), pass.getLength(), pass.getMatchString(), 1,
            "Duplication of an earlier pattern: " + pass.getName(), DUPLICATE_PATTERN, null);
        newPath.addPattern(dupp);
      } else {
        newPath.addPattern(pass);
      }
View Full Code Here
162
163
164
165
166
167
168
169
      patternSize *= 2;  //two possibilities, all upper, or all lower
    }
    CharSequence passString;
    passString = pass.getCharSequence().subSequence(start, length + start);
    pass.foundPattern(
        new PasswordPattern(start, length, passString,
        patternSize, pattern.toString(), patternName, keys.getName()));
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
  }
 
  @Test
  public void onePattern_Middle() {
    PasswordAnalysis_Unoptimized pa = new PasswordAnalysis_Unoptimized("1234");
    pa.foundPattern(new PasswordPattern(1, 2, "23", 4, "testPattern"));
   
    PathCost patterns = pa.calculateHighestProbablePatterns();
   
    List<PasswordPattern> list = patterns.getPath();
    assertEquals(3, list.size());
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
  }

  @Test
  public void onePattern_End() {
    PasswordAnalysis_Unoptimized pa = new PasswordAnalysis_Unoptimized("1234");
    pa.foundPattern(new PasswordPattern(2, 2, "34", 4, "testPattern"));
   
    PathCost patterns = pa.calculateHighestProbablePatterns();
   
    List<PasswordPattern> list = patterns.getPath();
    assertEquals(2, list.size());
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
 

  @Test
  public void onePattern_beginning() {
    PasswordAnalysis_Unoptimized pa = new PasswordAnalysis_Unoptimized("1234");
    pa.foundPattern(new PasswordPattern(0, 2, "12", 4, "testPattern"));
   
    PathCost patterns = pa.calculateHighestProbablePatterns();
   
    List<PasswordPattern> list = patterns.getPath();
    assertEquals(2, list.size());
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
  }
 
  @Test
  public void twoPattern_middle() {
    PasswordAnalysis_Unoptimized pa = new PasswordAnalysis_Unoptimized("12345");
    pa.foundPattern(new PasswordPattern(1, 1, "2", 2, "testPattern"));
    pa.foundPattern(new PasswordPattern(3, 1, "4", 2, "testPattern"));
   
    PathCost patterns = pa.calculateHighestProbablePatterns();
   
    List<PasswordPattern> list = patterns.getPath();
    assertEquals(5, list.size());
View Full Code Here
118
119
120
121
122
123
124
125
126
127
128
129
130
131
  }

  @Test
  public void onePattern_overlap(){
    PasswordAnalysis_Unoptimized pa = new PasswordAnalysis_Unoptimized("12345");
    pa.foundPattern(new PasswordPattern(1, 2, "23", 15, "worstPattern"));
    pa.foundPattern(new PasswordPattern(1, 2, "23", 4, "bestPattern"));
    pa.foundPattern(new PasswordPattern(1, 2, "23", 20, "worsePattern"));
    pa.foundPattern(new PasswordPattern(1, 2, "23", 23, "worserPattern"));
   
    PathCost patterns = pa.calculateHighestProbablePatterns();
   
    List<PasswordPattern> list = patterns.getPath();
    assertEquals(3, list.size());
View Full Code Here
TOP

Related Classes of org.owasp.passfault.PasswordPattern

  • org.owasp.passfault.dictionary.BackwardsAnalysisAdapter
  • org.owasp.passfault.dictionary.BackwardsAnalysisAdapterTest
  • org.owasp.passfault.finders.DateFinder
  • org.owasp.passfault.finders.RandomClassesFinder
  • org.owasp.passfault.finders.RandomPatternTest
  • org.owasp.passfault.finders.RepeatingPatternFinder
  • org.owasp.passfault.finders.RepeatingPatternFinderTest
  • org.owasp.passfault.io.JsonWriterTest
  • org.owasp.passfault.keyboard.KeySequenceFinder
  • org.owasp.passfault.PasswordAnalysis_Unoptimized
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.