我想执行字典攻击,为此我需要单词列表。如何从给定的特定长度的给定字符(或单词长度从最小长度到最大长度)生成单词列表?我尝试过itertools.combinations_with_replacements
和itertools.permutations
,但这无济于事。他们没有应该返回的所有单词列表。任何帮助将不胜感激。谢谢。
使用 itertools.product
:
>>> import itertools
>>>
>>> chrs = 'abc'
>>> n = 2
>>>
>>> for xs in itertools.product(chrs, repeat=n):
... print ''.join(xs)
...
aa
ab
ac
ba
bb
bc
ca
cb
cc
从最小长度到最大长度的消息:
chrs = 'abc'
min_length, max_length = 2, 5
for n in range(min_length, max_length+1):
for xs in itertools.product(chrs, repeat=n):
print ''.join(xs)
这是一个天真的实现:
list='abcdefg'
depth=8
def generate(l,d):
if d<1:
return
for c in l:
if d==1:
yield c
else:
for k in generate(l,d-1):
yield c+k
for d in range(1,depth):
for c in generate(list,d):
print c
我还没有足够的声誉来评论,因此,可以根据上面的Itertools示例列出完整列表:
import itertools
chrs='abc'
n=6
for i in range(1,n):
for xs in itertools.product(chrs, repeat=i):
print ''.join(xs)
这样,您的列表中的所有单词都从长度为1到n的所有单词。
from itertools import product
def allwords(chars, length):
for letters in product(chars, repeat=length):
yield ''.join(letters)
def main():
letters = "abc"
for wordlen in range(3, 5):
for word in allwords(letters, wordlen):
print(word)
if __name__=="__main__":
main()
返回
aaa
aab
aac
aba
abb
...
ccbc
ccca
cccb
cccc
def word_gen(start = 3,end = 3,elements = 1): "" hud seidu daannaa WordList Gen MSC Infosec,CEH"
README
#for start&end
#e.g. start= 3,end= 3
#means first words to last words should be 3 characters
#for elements
1 is asci
2 is numbers
3 is asci&numbers
"""
import itertools
#types of elements
if elements ==1: elements= 'abcdefghijklmnopqrstuvwxyx'
if elements ==2: elements= '0123456789'
if elements== 3: elements= 'abcdefghijklmnopqrstuvwxyx0123456789'
else: pass
wl = []
for i in range(start,end+1):
for xs in itertools.product(elements, repeat=i):
wl.append(''.join(xs))
return wl