gnh1201/caterpillar
1
0
Fork 0
mirror of https://github.com/gnh1201/caterpillar.git synced 2025-09-06 01:41:00 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update server.py

Browse Source
This commit is contained in:
Namhyeon Go 2024-02-22 14:42:50 +09:00 committed by GitHub
parent 28a0835827
commit 89441dc6d3
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 5 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
server.py
View File

@ -191,6 +191,9 @@ def proxy_check_filtered(data, webserver, port, scheme, method, url):
if len(matches) > 0: if len(matches) > 0:
print ("[*] Found ID: %s" % (', '.join(matches))) print ("[*] Found ID: %s" % (', '.join(matches)))
try: try:
for word in matches:
if not word.lower() in matches:
matches.append(word)
filtered = not all(map(pwnedpasswords_test, matches)) filtered = not all(map(pwnedpasswords_test, matches))
except Exception as e: except Exception as e:
print ("[*] K-Anonymity strategy not working! %s" % (str(e))) print ("[*] K-Anonymity strategy not working! %s" % (str(e)))
@ -503,6 +506,7 @@ def has_palindrome(input_string):
def is_palindrome(s): def is_palindrome(s):
return s == s[::-1] return s == s[::-1]
input_string = input_string.lower()
n = len(input_string) n = len(input_string)
for i in range(n): for i in range(n):
for j in range(i + 5, n + 1): # Find substrings of at least 5 characters for j in range(i + 5, n + 1): # Find substrings of at least 5 characters
@ -516,6 +520,7 @@ def has_known_word(input_string):
def is_known_word(s): def is_known_word(s):
return s in known_words return s in known_words
input_string = input_string.lower()
n = len(input_string) n = len(input_string)
for i in range(n): for i in range(n):
for j in range(i + 5, n + 1): # Find substrings of at least 5 characters for j in range(i + 5, n + 1): # Find substrings of at least 5 characters