Examples of org.owasp.passfault.PasswordAnalysis

org.owasp.passfault.PasswordAnalysis
This class holds the results of the analysis of a password. An instance of this class begins with a password to analyze. Then it is handed to multiple PatternFinders. This class contains the logic for post-analysis of the finders found (althought this logic might be better if separated from this class) This logic includes finding the weakest combination of finders and locating repeated finders. @author cam



54
55
56
57
58
59
60
61
62
63
64
65
66
67     assertEquals(expected, result, 0.5);
  }


  @Test
  public void onePattern_Middle() {
    PasswordAnalysis pa = new PasswordAnalysis("1234");
    pa.foundPattern(new PasswordPattern(1, 2, "23", 4, "testPattern"));


    PathCost patterns = pa.calculateHighestProbablePatterns();


    List<PasswordPattern> list = patterns.getPath();
    assertEquals(3, list.size());
    double result = patterns.getTotalCost();
    System.out.println("cost=" + result);

View Full Code Here





70
71
72
73
74
75
76
77
78
79
80
81
82
83     assertEquals(expected, result, 0.5);
  }


  @Test
  public void onePattern_End() {
    PasswordAnalysis pa = new PasswordAnalysis("1234");
    pa.foundPattern(new PasswordPattern(2, 2, "34", 4, "testPattern"));


    PathCost patterns = pa.calculateHighestProbablePatterns();


    List<PasswordPattern> list = patterns.getPath();
    assertEquals(2, list.size());
    double result = patterns.getTotalCost();
    System.out.println("cost=" + result);

View Full Code Here


85
86
87
88
89
90
91
92
93
94
95
96
97
98     assertEquals(expected, result, 0.5);
  }


  @Test
  public void onePattern_beginning() {
    PasswordAnalysis pa = new PasswordAnalysis("1234");
    pa.foundPattern(new PasswordPattern(0, 2, "12", 4, "testPattern"));


    PathCost patterns = pa.calculateHighestProbablePatterns();


    List<PasswordPattern> list = patterns.getPath();
    assertEquals(2, list.size());
    double result = patterns.getTotalCost();
    System.out.println("cost=" + result);

View Full Code Here


100
101
102
103
104
105
106
107
108
109
110
111
112
113
114     assertEquals(expected, result, 0.5);
  }


  @Test
  public void twoPattern_middle() {
    PasswordAnalysis pa = new PasswordAnalysis("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());
    double result = patterns.getTotalCost();
    System.out.println("cost=" + result);

View Full Code Here


117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133     assertEquals(expected, result, 0.5);
  }


  @Test
  public void onePattern_overlap() {
    PasswordAnalysis pa = new PasswordAnalysis("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());
    double result = patterns.getTotalCost();
    System.out.println("cost=" + result);

View Full Code Here


135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161     assertEquals(expected, result, 0.5);
  }


  @Test
  public void twoPattern_overlap() {
    PasswordAnalysis pa = new PasswordAnalysis("12345");
    pa.foundPattern(new PasswordPattern(1, 1, "2", 15, "badPattern"));
    pa.foundPattern(new PasswordPattern(1, 1, "2", 4, "bestPattern"));
    pa.foundPattern(new PasswordPattern(1, 1, "2", 20, "worserPattern"));
    pa.foundPattern(new PasswordPattern(1, 1, "2", 23, "worstPattern"));


    pa.foundPattern(new PasswordPattern(2, 2, "34", 15, "badPattern"));
    pa.foundPattern(new PasswordPattern(2, 2, "34", 20, "worserPattern"));
    pa.foundPattern(new PasswordPattern(2, 2, "34", 23, "worstPattern"));
    pa.foundPattern(new PasswordPattern(2, 2, "34", 4, "bestPattern"));


    pa.foundPattern(new PasswordPattern(4, 1, "5", 15, "badPattern"));
    pa.foundPattern(new PasswordPattern(4, 1, "5", 20, "worserPattern"));
    pa.foundPattern(new PasswordPattern(4, 1, "5", 4, "bestPattern"));
    pa.foundPattern(new PasswordPattern(4, 1, "5", 23, "worstPattern"));


    PathCost patterns = pa.calculateHighestProbablePatterns();


    List<PasswordPattern> list = patterns.getPath();
    assertEquals(4, list.size());
    double result = patterns.getTotalCost();
    System.out.println("cost=" + result);

View Full Code Here


163
164
165
166
167
168
169
170
171
172
173
174
175     assertEquals(expected, result, 0.5);
  }


  @Test
  public void allPossibleRandom() {
    PasswordAnalysis pa = new PasswordAnalysis("37384756683");
    RandomAddAll.RandomAddAll(pa);
    PathCost patterns = pa.calculateHighestProbablePatterns();


    List<PasswordPattern> list = patterns.getPath();
    assertEquals(1, list.size());
    double result = patterns.getTotalCost();
    System.out.println("cost=" + result);

View Full Code Here


48
49
50
51
52
53
54
55
56
57
58   }


  @Test
  public void findWord() throws Exception {
    System.out.println("findWord");
    PasswordAnalysis p = new PasswordAnalysis("wisp");
    finder.analyze(p);
    finder.waitForAnalysis(p);
    assertEquals(1, p.getPossiblePatternCount());


  }

View Full Code Here


58
59
60
61
62
63
64
65
66
67   }


  @Test
  public void findWord_garbageinfront() throws Exception {
    System.out.println("findWord_garbageinfront");
    PasswordAnalysis p = new PasswordAnalysis("1234wisp");
    finder.analyze(p);
    finder.waitForAnalysis(p);
    assertEquals(1, p.getPossiblePatternCount());
  }

View Full Code Here


68
69
70
71
72
73
74
75
76
77 
  @Test
  public void findWord_garbageinback() throws Exception {


    System.out.println("findWord_garbageinback");
    PasswordAnalysis p = new PasswordAnalysis("wisp1234");
    finder.analyze(p);
    finder.waitForAnalysis(p);
    assertEquals(1, p.getPossiblePatternCount());
  }

View Full Code Here



0
1
2
3



TOP

Related Classes of org.owasp.passfault.PasswordAnalysis

org.owasp.passfault.applet.Passfaultlet
org.owasp.passfault.dictionary.BackwardsAnalysisAdapterTest
org.owasp.passfault.finders.ParallelPatternsFinderTest
org.owasp.passfault.finders.RepeatingPatternFinderTest
org.owasp.passfault.keyboard.EnglishKeyBoardTest
org.owasp.passfault.keyboard.KeySequenceFinderTest
org.owasp.passfault.PasswordAnalysisTest
org.owasp.passfault.web.PassfaultServlet



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.