blob: 316cecedc209d861db8a46768594b08804348cf7 [file] [log] [blame]
Christian Heimes3626a502013-10-19 14:12:02 +02001#. Copyright (C) 2005-2010 Gregory P. Smith (greg@krypto.org)
Gregory P. Smithf21a5f72005-08-21 18:45:59 +00002# Licensed to PSF under a Contributor Agreement.
3#
4
5__doc__ = """hashlib module - A common interface to many hash functions.
6
Guido van Rossume22905a2007-08-27 23:09:25 +00007new(name, data=b'') - returns a new hash object implementing the
8 given hash function; initializing the hash
9 using the given binary data.
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000010
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000011Named constructor functions are also available, these are faster
12than using new(name):
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000013
14md5(), sha1(), sha224(), sha256(), sha384(), and sha512()
15
Gregory P. Smith13b55292010-09-06 08:30:23 +000016More algorithms may be available on your platform but the above are guaranteed
17to exist. See the algorithms_guaranteed and algorithms_available attributes
18to find out what algorithm names can be passed to new().
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000019
Christian Heimesd5e2b6f2008-03-19 21:50:51 +000020NOTE: If you want the adler32 or crc32 hash functions they are available in
21the zlib module.
22
Thomas Wouters89f507f2006-12-13 04:49:30 +000023Choose your hash function wisely. Some have known collision weaknesses.
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000024sha384 and sha512 will be slow on 32 bit platforms.
Thomas Wouters89f507f2006-12-13 04:49:30 +000025
26Hash objects have these methods:
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000027 - update(arg): Update the hash object with the bytes in arg. Repeated calls
Thomas Wouters89f507f2006-12-13 04:49:30 +000028 are equivalent to a single call with the concatenation of all
29 the arguments.
Gregory P. Smith2f21eb32007-09-09 06:44:34 +000030 - digest(): Return the digest of the bytes passed to the update() method
31 so far.
32 - hexdigest(): Like digest() except the digest is returned as a unicode
33 object of double length, containing only hexadecimal digits.
Thomas Wouters89f507f2006-12-13 04:49:30 +000034 - copy(): Return a copy (clone) of the hash object. This can be used to
35 efficiently compute the digests of strings that share a common
36 initial substring.
37
38For example, to obtain the digest of the string 'Nobody inspects the
39spammish repetition':
40
41 >>> import hashlib
42 >>> m = hashlib.md5()
Guido van Rossume22905a2007-08-27 23:09:25 +000043 >>> m.update(b"Nobody inspects")
44 >>> m.update(b" the spammish repetition")
Thomas Wouters89f507f2006-12-13 04:49:30 +000045 >>> m.digest()
Gregory P. Smith63594502008-08-31 16:35:01 +000046 b'\\xbbd\\x9c\\x83\\xdd\\x1e\\xa5\\xc9\\xd9\\xde\\xc9\\xa1\\x8d\\xf0\\xff\\xe9'
Thomas Wouters89f507f2006-12-13 04:49:30 +000047
48More condensed:
49
Guido van Rossume22905a2007-08-27 23:09:25 +000050 >>> hashlib.sha224(b"Nobody inspects the spammish repetition").hexdigest()
Thomas Wouters89f507f2006-12-13 04:49:30 +000051 'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2'
52
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000053"""
54
Gregory P. Smithd8fe8bf2009-08-16 22:08:56 +000055# This tuple and __get_builtin_constructor() must be modified if a new
56# always available algorithm is added.
Martin v. Löwis24e43302014-01-03 14:05:06 +010057__always_supported = ('md5', 'sha1', 'sha224', 'sha256', 'sha384', 'sha512')
Gregory P. Smithd8fe8bf2009-08-16 22:08:56 +000058
Raymond Hettingerbf1d2bc2011-01-24 04:52:27 +000059algorithms_guaranteed = set(__always_supported)
60algorithms_available = set(__always_supported)
Gregory P. Smith86508cc2010-03-01 02:05:26 +000061
Gregory P. Smith13b55292010-09-06 08:30:23 +000062__all__ = __always_supported + ('new', 'algorithms_guaranteed',
Christian Heimes3626a502013-10-19 14:12:02 +020063 'algorithms_available', 'pbkdf2_hmac')
Gregory P. Smithd8fe8bf2009-08-16 22:08:56 +000064
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000065
Christian Heimese5351072013-10-22 14:59:12 +020066__builtin_constructor_cache = {}
67
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000068def __get_builtin_constructor(name):
Christian Heimese5351072013-10-22 14:59:12 +020069 cache = __builtin_constructor_cache
70 constructor = cache.get(name)
71 if constructor is not None:
72 return constructor
Gregory P. Smith12c9d022011-05-14 15:15:49 -070073 try:
74 if name in ('SHA1', 'sha1'):
75 import _sha1
Christian Heimese5351072013-10-22 14:59:12 +020076 cache['SHA1'] = cache['sha1'] = _sha1.sha1
Gregory P. Smith12c9d022011-05-14 15:15:49 -070077 elif name in ('MD5', 'md5'):
78 import _md5
Christian Heimese5351072013-10-22 14:59:12 +020079 cache['MD5'] = cache['md5'] = _md5.md5
Gregory P. Smith12c9d022011-05-14 15:15:49 -070080 elif name in ('SHA256', 'sha256', 'SHA224', 'sha224'):
81 import _sha256
Christian Heimese5351072013-10-22 14:59:12 +020082 cache['SHA224'] = cache['sha224'] = _sha256.sha224
83 cache['SHA256'] = cache['sha256'] = _sha256.sha256
Gregory P. Smith12c9d022011-05-14 15:15:49 -070084 elif name in ('SHA512', 'sha512', 'SHA384', 'sha384'):
85 import _sha512
Christian Heimese5351072013-10-22 14:59:12 +020086 cache['SHA384'] = cache['sha384'] = _sha512.sha384
87 cache['SHA512'] = cache['sha512'] = _sha512.sha512
Brett Cannoncd171c82013-07-04 17:43:24 -040088 except ImportError:
Gregory P. Smitha3221f82011-05-14 15:35:19 -070089 pass # no extension module, this hash is unsupported.
Gregory P. Smithf21a5f72005-08-21 18:45:59 +000090
Christian Heimese5351072013-10-22 14:59:12 +020091 constructor = cache.get(name)
92 if constructor is not None:
93 return constructor
94
Gregory P. Smith76c28f72012-07-21 21:19:53 -070095 raise ValueError('unsupported hash type ' + name)
Gregory P. Smithd8fe8bf2009-08-16 22:08:56 +000096
97
98def __get_openssl_constructor(name):
99 try:
100 f = getattr(_hashlib, 'openssl_' + name)
101 # Allow the C module to raise ValueError. The function will be
102 # defined but the hash not actually available thanks to OpenSSL.
103 f()
104 # Use the C function directly (very fast)
105 return f
106 except (AttributeError, ValueError):
107 return __get_builtin_constructor(name)
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000108
109
Guido van Rossume22905a2007-08-27 23:09:25 +0000110def __py_new(name, data=b''):
Gregory P. Smith2f21eb32007-09-09 06:44:34 +0000111 """new(name, data=b'') - Return a new hashing object using the named algorithm;
Guido van Rossume22905a2007-08-27 23:09:25 +0000112 optionally initialized with data (which must be bytes).
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000113 """
Guido van Rossume22905a2007-08-27 23:09:25 +0000114 return __get_builtin_constructor(name)(data)
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000115
116
Guido van Rossume22905a2007-08-27 23:09:25 +0000117def __hash_new(name, data=b''):
118 """new(name, data=b'') - Return a new hashing object using the named algorithm;
119 optionally initialized with data (which must be bytes).
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000120 """
121 try:
Guido van Rossume22905a2007-08-27 23:09:25 +0000122 return _hashlib.new(name, data)
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000123 except ValueError:
124 # If the _hashlib module (OpenSSL) doesn't support the named
125 # hash, try using our builtin implementations.
126 # This allows for SHA224/256 and SHA384/512 support even though
127 # the OpenSSL library prior to 0.9.8 doesn't provide them.
Guido van Rossume22905a2007-08-27 23:09:25 +0000128 return __get_builtin_constructor(name)(data)
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000129
130
131try:
132 import _hashlib
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000133 new = __hash_new
Gregory P. Smithd8fe8bf2009-08-16 22:08:56 +0000134 __get_hash = __get_openssl_constructor
Gregory P. Smith13b55292010-09-06 08:30:23 +0000135 algorithms_available = algorithms_available.union(
136 _hashlib.openssl_md_meth_names)
Brett Cannoncd171c82013-07-04 17:43:24 -0400137except ImportError:
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000138 new = __py_new
Gregory P. Smithd8fe8bf2009-08-16 22:08:56 +0000139 __get_hash = __get_builtin_constructor
Gregory P. Smithf21a5f72005-08-21 18:45:59 +0000140
Christian Heimese92ef132013-10-13 00:52:43 +0200141try:
Christian Heimes3626a502013-10-19 14:12:02 +0200142 # OpenSSL's PKCS5_PBKDF2_HMAC requires OpenSSL 1.0+ with HMAC and SHA
Christian Heimese92ef132013-10-13 00:52:43 +0200143 from _hashlib import pbkdf2_hmac
144except ImportError:
Christian Heimes3626a502013-10-19 14:12:02 +0200145 _trans_5C = bytes((x ^ 0x5C) for x in range(256))
146 _trans_36 = bytes((x ^ 0x36) for x in range(256))
147
148 def pbkdf2_hmac(hash_name, password, salt, iterations, dklen=None):
149 """Password based key derivation function 2 (PKCS #5 v2.0)
150
151 This Python implementations based on the hmac module about as fast
152 as OpenSSL's PKCS5_PBKDF2_HMAC for short passwords and much faster
153 for long passwords.
154 """
155 if not isinstance(hash_name, str):
156 raise TypeError(hash_name)
157
158 if not isinstance(password, (bytes, bytearray)):
159 password = bytes(memoryview(password))
160 if not isinstance(salt, (bytes, bytearray)):
161 salt = bytes(memoryview(salt))
162
163 # Fast inline HMAC implementation
164 inner = new(hash_name)
165 outer = new(hash_name)
166 blocksize = getattr(inner, 'block_size', 64)
167 if len(password) > blocksize:
168 password = new(hash_name, password).digest()
169 password = password + b'\x00' * (blocksize - len(password))
170 inner.update(password.translate(_trans_36))
171 outer.update(password.translate(_trans_5C))
172
173 def prf(msg, inner=inner, outer=outer):
174 # PBKDF2_HMAC uses the password as key. We can re-use the same
Serhiy Storchaka56a6d852014-12-01 18:28:43 +0200175 # digest objects and just update copies to skip initialization.
Christian Heimes3626a502013-10-19 14:12:02 +0200176 icpy = inner.copy()
177 ocpy = outer.copy()
178 icpy.update(msg)
179 ocpy.update(icpy.digest())
180 return ocpy.digest()
181
182 if iterations < 1:
183 raise ValueError(iterations)
184 if dklen is None:
185 dklen = outer.digest_size
186 if dklen < 1:
187 raise ValueError(dklen)
188
189 dkey = b''
190 loop = 1
191 from_bytes = int.from_bytes
192 while len(dkey) < dklen:
193 prev = prf(salt + loop.to_bytes(4, 'big'))
194 # endianess doesn't matter here as long to / from use the same
195 rkey = int.from_bytes(prev, 'big')
196 for i in range(iterations - 1):
197 prev = prf(prev)
198 # rkey = rkey ^ prev
199 rkey ^= from_bytes(prev, 'big')
200 loop += 1
201 dkey += rkey.to_bytes(inner.digest_size, 'big')
202
203 return dkey[:dklen]
204
Christian Heimese92ef132013-10-13 00:52:43 +0200205
Gregory P. Smithd8fe8bf2009-08-16 22:08:56 +0000206for __func_name in __always_supported:
207 # try them all, some may not work due to the OpenSSL
208 # version not supporting that algorithm.
209 try:
210 globals()[__func_name] = __get_hash(__func_name)
211 except ValueError:
212 import logging
213 logging.exception('code for hash %s was not found.', __func_name)
214
215# Cleanup locals()
216del __always_supported, __func_name, __get_hash
217del __py_new, __hash_new, __get_openssl_constructor