Ticket #31647: 31647.diff

data-scripts/build_frequency_lists.py

@@ -117 +117 @@
     return result
 
 def to_kv(lst, lst_name):
+    lst = map(lambda x : codecs.encode(x, 'rot_13'), lst)
     val = '"%s".split(",")' % ','.join(lst)
     return '%s: %s' % (lst_name, val)
 

src/main.coffee

@@ -5 +5 @@
 
 time = -> (new Date()).getTime()
 
+rot_13 = (str) ->
+  str.replace /[a-zA-Z]/g, (c) ->
+    String.fromCharCode (if ((if c <= "Z" then 90 else 122)) >= (c = c.charCodeAt(0) + 13) then c else c - 26)
+
 zxcvbn = (password, user_inputs = []) ->
   start = time()
   # reset the user inputs matcher on a per-request basis to keep things stateless
   sanitized_inputs = []
   for arg in user_inputs
     if typeof arg in ["string", "number", "boolean"]
-      sanitized_inputs.push arg.toString().toLowerCase()
+      sanitized_inputs.push rot_13(arg.toString().toLowerCase())
   matching.set_user_input_dictionary sanitized_inputs
   matches = matching.omnimatch password
   result = scoring.most_guessable_match_sequence password, matches

src/matching.coffee

@@ -2 +2 @@
 adjacency_graphs = require('./adjacency_graphs')
 scoring = require('./scoring')
 
+rot_13 = (str) ->
+  str.replace /[a-zA-Z]/g, (c) ->
+    String.fromCharCode (if ((if c <= "Z" then 90 else 122)) >= (c = c.charCodeAt(0) + 13) then c else c - 26)
+
 build_ranked_dict = (ordered_list) ->
   result = {}
   i = 1 # rank starts at 1, not 0
@@ -103 +107 @@
     matches = []
     len = password.length
     password_lower = password.toLowerCase()
+    password_lower = rot_13(password_lower)
     for dictionary_name, ranked_dict of _ranked_dictionaries
       for i in [0...len]
         for j in [i...len]
@@ -114 +119 @@
               i: i
               j: j
               token: password[i..j]
-              matched_word: word
+              matched_word: rot_13(word)
               rank: rank
               dictionary_name: dictionary_name
               reversed: false