Joining 2 dictionaries together without bruteforcing one side
#7
an alternative to the perl script, you can also use splitlen from hashcat-utilities to organize words by length.

Code:
combinator.bin adj.txt noun.txt > adj_noun.dict

Code:
splitlen.bin length/ < adj_noun.dict

Code:
wc -l length/*
       0 length/01
       0 length/02
       0 length/03
       0 length/04
     102 length/05
    4719 length/06
   33445 length/07
  113522 length/08
  239273 length/09
  365270 length/10
  472998 length/11
  546905 length/12
  563588 length/13
  528990 length/14
  452563 length/15
  353738 length/16
  260460 length/17
  177939 length/18
  114479 length/19
   69945 length/20
   40277 length/21
   22505 length/22
   11865 length/23
    6101 length/24
    3172 length/25
    1569 length/26
     743 length/27
     319 length/28
     119 length/29
      56 length/30
      12 length/31
       6 length/32
       0 length/33
       0 length/34
       0 length/35
       0 length/36
       0 length/37
       0 length/38
       0 length/39
       0 length/40
       0 length/41
       0 length/42
       0 length/43
       0 length/44
       0 length/45
       0 length/46
       0 length/47
       0 length/48
       0 length/49
       0 length/50
       0 length/51
       0 length/52
       0 length/53
       0 length/54
       0 length/55
       0 length/56
       0 length/57
       0 length/58
       0 length/59
       0 length/60
       0 length/61
       0 length/62
       0 length/63
       0 length/64
4384680 total

you can then delete all the files that have zero bytes.

my opinion is that netgear would not want their customers typing more than a 20 length passwords. that could be considered bad user-experience. 20+ length is not a big deal on computers but having to type that into your xbox, playstation, cell phone, TV, etc. is a pain, but that theory needs to be proven.


Messages In This Thread
RE: Joining 2 dictionaries together without bruteforcing one side - by forumhero - 11-24-2014, 08:10 PM