检查密码的强度(如何检查条件)

我正在尝试创build一个要求您input密码的系统。 如果全是低的,高的或者低的则打印弱,如果是两个条件的话,那么它是中等的,如果都满足的话就强。 它似乎并没有工作。

而弱小而坚强的作品则不是。

我不知道我哪里错了。

def password(): print ('enter password') print () print () print ('the password must be at least 6, and no more than 12 characters long') print () password = input ('type your password ....') weak = 'weak' med = 'medium' strong = 'strong' if len(password) >12: print ('password is too long It must be between 6 and 12 characters') elif len(password) <6: print ('password is too short It must be between 6 and 12 characters') elif len(password) >=6 and len(password) <= 12: print ('password ok') if password.lower()== password or password.upper()==password or password.isalnum()==password: print ('password is', weak) elif password.lower()== password and password.upper()==password or password.isalnum()==password: print ('password is', med) else: password.lower()== password and password.upper()==password and password.isalnum()==password print ('password is', strong) 

你好
最好的方法是使用正则expression式search
这是我目前使用的function

 def password_check(password): """ Verify the strength of 'password' Returns a dict indicating the wrong criteria A password is considered strong if: 8 characters length or more 1 digit or more 1 symbol or more 1 uppercase letter or more 1 lowercase letter or more """ # calculating the length length_error = len(password) < 8 # searching for digits digit_error = re.search(r"\d", password) is None # searching for uppercase uppercase_error = re.search(r"[AZ]", password) is None # searching for lowercase lowercase_error = re.search(r"[az]", password) is None # searching for symbols symbol_error = re.search(r"[ !#$%&'()*+,-./[\\\]^_`{|}~"+r'"]', password) is None # overall result password_ok = not ( length_error or digit_error or uppercase_error or lowercase_error or symbol_error ) return { 'password_ok' : password_ok, 'length_error' : length_error, 'digit_error' : digit_error, 'uppercase_error' : uppercase_error, 'lowercase_error' : lowercase_error, 'symbol_error' : symbol_error, } 

编辑:
在这里,关于卢卡斯的build议是对特殊符号条件validation的更新

 symbol_error = re.search(r"\W", password) is None 

password.isalnum()返回一个布尔值,所以password.isalnum()==password始终False

只要忽略==password部分:

 if password.lower()== password or password.upper()==password or password.isalnum(): # ... 

接下来,它不可能是全部上下,或者全部上,下或者全部数字,所以第二个条件(中)是不可能的。 也许你应该寻找一些大写,小写和数字的存在呢?

然而,第一个问题要解决。 您正在testing密码是否为字母数字 ,仅由字符和/或数字组成。 如果您只想testing数字,请使用.isdigit()

您可能需要熟悉string方法 。 有一些方便的.islower().isupper()方法可供您尝试,例如:

 >>> 'abc'.islower() True >>> 'abc123'.islower() True >>> 'Abc123'.islower() False >>> 'ABC'.isupper() True >>> 'ABC123'.isupper() True >>> 'Abc123'.isupper() False 

使用password.upper() == password这些更快更简单,以下将testing相同:

 if password.isupper() or password.islower() or password.isdigit(): # very weak indeed 

下一个你要学习的技巧是循环一个string,这样你可以testing单个字符:

 >>> [c.isdigit() for c in 'abc123'] [False, False, False, True, True, True] 

如果将它与any()函数结合使用,则可以testing是否有一些字符是数字:

 >>> any(c.isdigit() for c in 'abc123') True >>> any(c.isdigit() for c in 'abc') False 

我想在testing密码强度时,你会发现这些技巧。

这里是你写的东西的翻版:

 import re def password(): print ('Enter a password\n\nThe password must be between 6 and 12 characters.\n') while True: password = input('Password: ... ') if 6 <= len(password) < 12: break print ('The password must be between 6 and 12 characters.\n') password_scores = {0:'Horrible', 1:'Weak', 2:'Medium', 3:'Strong'} password_strength = dict.fromkeys(['has_upper', 'has_lower', 'has_num'], False) if re.search(r'[AZ]', password): password_strength['has_upper'] = True if re.search(r'[az]', password): password_strength['has_lower'] = True if re.search(r'[0-9]', password): password_strength['has_num'] = True score = len([b for b in password_strength.values() if b]) print ('Password is %s' % password_scores[score]) 

输出(样本):

 >>> password() Enter a password The password must be between 6 and 12 characters. Password: ... ghgG234 Password is Strong 

我也在寻找一些密码强度检查function,并发现很多半意的build议。 我以自己的function为基础进行了组装。

希望有所帮助

 def get_pw_strength( pw ): s_lc = set(['a', 'c', 'b', 'e', 'd', 'g', 'f', 'i', 'h', 'k', 'j', 'm', 'l', 'o', 'n', 'q', 'p', 's', 'r', 'u', 't', 'w', 'v', 'y', 'x', 'z']) s_uc = set(['A', 'C', 'B', 'E', 'D', 'G', 'F', 'I', 'H', 'K', 'J', 'M', 'L', 'O', 'N', 'Q', 'P', 'S', 'R', 'U', 'T', 'W', 'V', 'Y', 'X', 'Z']) s_dg = set(['1', '0', '3', '2', '5', '4', '7', '6', '9', '8']) s_sp = set(['+', ',', '.', '-', '?', ':', '_', '(', ')', '*', '/', ';', '+', '!']) pw_s = 0 pw_steps = (5, 8, 12) pw_l = len(pw) if ( pw_l < 4 ): return 0 for l in pw_steps : if ( pw_l > l ): pw_s += 1 #print "length over ", l," giving point", pw_s c_lc = c_uc = c_dg = c_sp = 0 for c in pw : if ( c in s_lc ) : c_lc += 1 if ( c in s_uc ) : c_uc += 1 if ( c in s_dg ) : c_dg += 1 if ( c in s_sp ) : c_sp += 1 if ( c_lc + c_uc + c_dg + c_sp <> pw_l ): #print c_lc, c_uc, c_dg, c_sp, pw_l #raise Exception "Forbidden chracter" return -1 charset = 0 if ( c_lc ) : pw_s += 1 charset = len(s_lc) if ( c_uc ) : pw_s += 1 charset = len(s_uc) if ( c_dg ) : pw_s += 1 charset = len(s_dg) if ( c_sp ) : pw_s += 2 charset = len(s_sp) entropy = log(pow(charset,pw_l),2) return pw_s, entropy