weakPassword校验工具
package com.dimpt.base.util;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class PasswordUtil {
private static final Boolean THROUGH = true;
private static final Boolean NOT_THROUGH = false;
private static final Integer MAX_SORT = 4;
private static final Integer PASSWORD_MIN_LENGTH = 8;
private static final String[] ORDER_STRING = new String[]{"~!@#$%^&*()_+", "`1234567890-=", "qwertyuiop[]\\", "QWRTYUIOP{}|", "asdfghjkl;'", "ASDFGHJKL:\"", "zxcvbnm,./", "ZXCVBNM<>?"};
static String PWD_0_9 = ".*[0-9].*";
static String PWD_a_z = ".*[a-z].*";
static String PWD_A_Z = ".*[A-Z].*";
static String PWD_SYMBOL = ".*[【·=、;‘,。、《》?:“”{-}|+—)(-)*&…%¥#@!~’`=\\[\\];',./?><\":|}{+_)(*&^%$#@!~】].*";
public static Boolean checkPassword(String userName, String password) {
if (!checkLength(password)) {
System.out.println("密码长度不足");
return NOT_THROUGH;
}
if (!repeat(password)) {
System.out.println("出现连续重复字符");
return NOT_THROUGH;
}
if (!pwdVerify(password)) {
System.out.println("密码强度不够");
return NOT_THROUGH;
}
if (!isNotSortString(password)) {
System.out.println("存在键盘排序");
return NOT_THROUGH;
}
if (!find(userName, password)) {
System.out.println("账号与密码相似");
return NOT_THROUGH;
}
return THROUGH;
}
private static Boolean checkLength(String password) {
if (password.length() < PASSWORD_MIN_LENGTH) {
return NOT_THROUGH;
}
return THROUGH;
}
private static Boolean repeat(String pwd) {
pwd = pwd.toLowerCase();
char[] pwdChar = pwd.toCharArray();
Integer params;
for (int i = 0; i < pwdChar.length; i++) {
params = 1;
for (int j = i + 1; j < pwdChar.length; j++) {
if (pwdChar[i] == pwdChar[j]) {
params++;
if (MAX_SORT.equals(params)) {
return NOT_THROUGH;
}
} else {
break;
}
}
}
return THROUGH;
}
private static Boolean pwdVerify(String pwd) {
Integer flag = 0;
if (pwd.matches(PWD_0_9)) {
flag++;
}
if (pwd.matches(PWD_a_z)) {
flag++;
}
if (pwd.matches(PWD_A_Z)) {
flag++;
}
if (pwd.matches(PWD_SYMBOL)) {
flag++;
}
if (flag < 3) {
return NOT_THROUGH;
} else {
return THROUGH;
}
}
private static Boolean isNotSortString(String pwd) {
int size = pwd.length();
String tmp;
Integer index;
for (String string : ORDER_STRING) {
index = 0;
for (int i = MAX_SORT; i <= size; i++) {
tmp = pwd.substring(index++, i);
if (string.contains(tmp)) {
return NOT_THROUGH;
}
}
}
return THROUGH;
}
private static Boolean find(String account, String pwd) {
account = account.toLowerCase();
pwd = pwd.toLowerCase();
Pattern regex = Pattern.compile(account);
Matcher matcher = regex.matcher(pwd);
if (matcher.find()) {
return NOT_THROUGH;
}
return THROUGH;
}
}