def _make_hash(self, password):
"""Generate a random salt and return a new hash for the password."""
if isinstance(password, unicode):
password = password.encode("utf-8")
salt = b64encode(urandom(SALT_LENGTH))
hashed_password = "******" % (
HASH_FUNCTION,
COST_FACTOR,
salt,
b64encode(pbkdf2_bin(password, salt, COST_FACTOR, KEY_LENGTH, getattr(hashlib, HASH_FUNCTION))),
)
self.password = hashed_password
def validate_password(self, password):
"""Check a password against an existing hash."""
if isinstance(password, unicode):
password = password.encode("utf-8")
print password
algorithm, hash_function, cost_factor, salt, hash_a = self.password.split("$")
assert algorithm == "PBKDF2"
hash_a = b64decode(hash_a)
hash_b = pbkdf2_bin(password, salt, int(cost_factor), len(hash_a), getattr(hashlib, hash_function))
assert len(hash_a) == len(hash_b) # we requested this from pbkdf2_bin()
# Same as "return hash_a == hash_b" but takes a constant time.
# See http://carlos.bueno.org/2011/10/timing.html
diff = 0
for char_a, char_b in izip(hash_a, hash_b):
diff |= ord(char_a) ^ ord(char_b)
return diff == 0