blob: a2e96caf76335aff0eafc956f3e40556bd2fc6fd [file] [log] [blame]
Georg Brandl116aa622007-08-15 14:28:22 +00001:mod:`hashlib` --- Secure hashes and message digests
2====================================================
3
4.. module:: hashlib
5 :synopsis: Secure hash and message digest algorithms.
Terry Jan Reedyfa089b92016-06-11 15:02:54 -04006
Benjamin Peterson058e31e2009-01-16 03:54:08 +00007.. moduleauthor:: Gregory P. Smith <greg@krypto.org>
8.. sectionauthor:: Gregory P. Smith <greg@krypto.org>
Georg Brandl116aa622007-08-15 14:28:22 +00009
Terry Jan Reedyfa089b92016-06-11 15:02:54 -040010**Source code:** :source:`Lib/hashlib.py`
Georg Brandl116aa622007-08-15 14:28:22 +000011
Georg Brandl116aa622007-08-15 14:28:22 +000012.. index::
13 single: message digest, MD5
14 single: secure hash algorithm, SHA1, SHA224, SHA256, SHA384, SHA512
15
Zachary Ware4199bba2016-08-10 01:05:19 -050016.. testsetup::
17
18 import hashlib
19
20
Raymond Hettinger469271d2011-01-27 20:38:46 +000021--------------
22
Georg Brandl116aa622007-08-15 14:28:22 +000023This module implements a common interface to many different secure hash and
24message digest algorithms. Included are the FIPS secure hash algorithms SHA1,
25SHA224, SHA256, SHA384, and SHA512 (defined in FIPS 180-2) as well as RSA's MD5
Georg Brandl67ced422007-09-06 14:09:10 +000026algorithm (defined in Internet :rfc:`1321`). The terms "secure hash" and
27"message digest" are interchangeable. Older algorithms were called message
28digests. The modern term is secure hash.
Georg Brandl116aa622007-08-15 14:28:22 +000029
Christian Heimesd5e2b6f2008-03-19 21:50:51 +000030.. note::
Georg Brandl6e94a302013-10-06 18:26:36 +020031
32 If you want the adler32 or crc32 hash functions, they are available in
Christian Heimesd5e2b6f2008-03-19 21:50:51 +000033 the :mod:`zlib` module.
34
Georg Brandl116aa622007-08-15 14:28:22 +000035.. warning::
36
Georg Brandl6e94a302013-10-06 18:26:36 +020037 Some algorithms have known hash collision weaknesses, refer to the "See
38 also" section at the end.
Georg Brandl116aa622007-08-15 14:28:22 +000039
Christian Heimese92ef132013-10-13 00:52:43 +020040
R David Murraycde1a062013-12-20 16:33:52 -050041.. _hash-algorithms:
42
Christian Heimese92ef132013-10-13 00:52:43 +020043Hash algorithms
44---------------
45
Georg Brandl116aa622007-08-15 14:28:22 +000046There is one constructor method named for each type of :dfn:`hash`. All return
47a hash object with the same simple interface. For example: use :func:`sha1` to
Ezio Melottic228e962013-05-04 18:06:34 +030048create a SHA1 hash object. You can now feed this object with :term:`bytes-like
Serhiy Storchakae5ea1ab2016-05-18 13:54:54 +030049objects <bytes-like object>` (normally :class:`bytes`) using the :meth:`update` method.
Ezio Melottic228e962013-05-04 18:06:34 +030050At any point you can ask it for the :dfn:`digest` of the
Georg Brandl67ced422007-09-06 14:09:10 +000051concatenation of the data fed to it so far using the :meth:`digest` or
52:meth:`hexdigest` methods.
53
54.. note::
55
Benjamin Peterson9cb7bd22012-12-20 20:24:37 -060056 For better multithreading performance, the Python :term:`GIL` is released for
Jesus Cea5b22dd82013-10-04 04:20:37 +020057 data larger than 2047 bytes at object creation or on update.
Antoine Pitroubcd5cbe2009-01-08 21:17:16 +000058
59.. note::
60
Benjamin Petersonbd584d52012-12-20 20:22:47 -060061 Feeding string objects into :meth:`update` is not supported, as hashes work
Georg Brandl67ced422007-09-06 14:09:10 +000062 on bytes, not on characters.
Georg Brandl116aa622007-08-15 14:28:22 +000063
Thomas Wouters1b7f8912007-09-19 03:06:30 +000064.. index:: single: OpenSSL; (use in module hashlib)
Georg Brandl116aa622007-08-15 14:28:22 +000065
66Constructors for hash algorithms that are always present in this module are
Christian Heimes4a0270d2012-10-06 02:23:36 +020067:func:`md5`, :func:`sha1`, :func:`sha224`, :func:`sha256`, :func:`sha384`,
Martin v. Löwis24e43302014-01-03 14:05:06 +010068and :func:`sha512`. Additional algorithms may also be available depending upon
Christian Heimes4a0270d2012-10-06 02:23:36 +020069the OpenSSL library that Python uses on your platform.
70
Georg Brandl67ced422007-09-06 14:09:10 +000071For example, to obtain the digest of the byte string ``b'Nobody inspects the
72spammish repetition'``::
Georg Brandl116aa622007-08-15 14:28:22 +000073
74 >>> import hashlib
75 >>> m = hashlib.md5()
Georg Brandl67ced422007-09-06 14:09:10 +000076 >>> m.update(b"Nobody inspects")
77 >>> m.update(b" the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +000078 >>> m.digest()
Georg Brandl67ced422007-09-06 14:09:10 +000079 b'\xbbd\x9c\x83\xdd\x1e\xa5\xc9\xd9\xde\xc9\xa1\x8d\xf0\xff\xe9'
Guido van Rossuma19f80c2007-11-06 20:51:31 +000080 >>> m.digest_size
81 16
82 >>> m.block_size
83 64
Georg Brandl116aa622007-08-15 14:28:22 +000084
Christian Heimesfe337bf2008-03-23 21:54:12 +000085More condensed:
Georg Brandl116aa622007-08-15 14:28:22 +000086
Georg Brandl67ced422007-09-06 14:09:10 +000087 >>> hashlib.sha224(b"Nobody inspects the spammish repetition").hexdigest()
Benjamin Peterson0fa3f3d2008-12-29 20:52:09 +000088 'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2'
Georg Brandl116aa622007-08-15 14:28:22 +000089
Gregory P. Smith13b55292010-09-06 08:30:23 +000090.. function:: new(name[, data])
91
92 Is a generic constructor that takes the string name of the desired
93 algorithm as its first parameter. It also exists to allow access to the
94 above listed hashes as well as any other algorithms that your OpenSSL
95 library may offer. The named constructors are much faster than :func:`new`
96 and should be preferred.
Georg Brandl116aa622007-08-15 14:28:22 +000097
Christian Heimesfe337bf2008-03-23 21:54:12 +000098Using :func:`new` with an algorithm provided by OpenSSL:
Georg Brandl116aa622007-08-15 14:28:22 +000099
100 >>> h = hashlib.new('ripemd160')
Georg Brandl67ced422007-09-06 14:09:10 +0000101 >>> h.update(b"Nobody inspects the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +0000102 >>> h.hexdigest()
Benjamin Peterson0fa3f3d2008-12-29 20:52:09 +0000103 'cc4a5ce1b3df48aec5d22d1f16b894a0b894eccc'
Georg Brandl116aa622007-08-15 14:28:22 +0000104
Gregory P. Smith13b55292010-09-06 08:30:23 +0000105Hashlib provides the following constant attributes:
Gregory P. Smith86508cc2010-03-01 02:05:26 +0000106
Gregory P. Smith13b55292010-09-06 08:30:23 +0000107.. data:: algorithms_guaranteed
Gregory P. Smith86508cc2010-03-01 02:05:26 +0000108
Larry Hastings3732ed22014-03-15 21:13:56 -0700109 A set containing the names of the hash algorithms guaranteed to be supported
Gregory P. Smith13b55292010-09-06 08:30:23 +0000110 by this module on all platforms.
111
112 .. versionadded:: 3.2
113
114.. data:: algorithms_available
115
Larry Hastings3732ed22014-03-15 21:13:56 -0700116 A set containing the names of the hash algorithms that are available in the
117 running Python interpreter. These names will be recognized when passed to
118 :func:`new`. :attr:`algorithms_guaranteed` will always be a subset. The
119 same algorithm may appear multiple times in this set under different names
120 (thanks to OpenSSL).
Gregory P. Smith86508cc2010-03-01 02:05:26 +0000121
122 .. versionadded:: 3.2
123
Georg Brandl116aa622007-08-15 14:28:22 +0000124The following values are provided as constant attributes of the hash objects
125returned by the constructors:
126
127
Benjamin Peterson4ac9ce42009-10-04 14:49:41 +0000128.. data:: hash.digest_size
Georg Brandl116aa622007-08-15 14:28:22 +0000129
Guido van Rossuma19f80c2007-11-06 20:51:31 +0000130 The size of the resulting hash in bytes.
131
Benjamin Peterson4ac9ce42009-10-04 14:49:41 +0000132.. data:: hash.block_size
Guido van Rossuma19f80c2007-11-06 20:51:31 +0000133
134 The internal block size of the hash algorithm in bytes.
Georg Brandl116aa622007-08-15 14:28:22 +0000135
Jason R. Coombsb2aa6f42013-08-03 11:39:39 +0200136A hash object has the following attributes:
137
138.. attribute:: hash.name
139
140 The canonical name of this hash, always lowercase and always suitable as a
141 parameter to :func:`new` to create another hash of this type.
142
143 .. versionchanged:: 3.4
144 The name attribute has been present in CPython since its inception, but
145 until Python 3.4 was not formally specified, so may not exist on some
146 platforms.
147
Georg Brandl116aa622007-08-15 14:28:22 +0000148A hash object has the following methods:
149
150
151.. method:: hash.update(arg)
152
Georg Brandl67ced422007-09-06 14:09:10 +0000153 Update the hash object with the object *arg*, which must be interpretable as
154 a buffer of bytes. Repeated calls are equivalent to a single call with the
155 concatenation of all the arguments: ``m.update(a); m.update(b)`` is
156 equivalent to ``m.update(a+b)``.
Georg Brandl116aa622007-08-15 14:28:22 +0000157
Georg Brandl705d9d52009-05-05 09:29:50 +0000158 .. versionchanged:: 3.1
Georg Brandl67b21b72010-08-17 15:07:14 +0000159 The Python GIL is released to allow other threads to run while hash
Jesus Cea5b22dd82013-10-04 04:20:37 +0200160 updates on data larger than 2047 bytes is taking place when using hash
Georg Brandl67b21b72010-08-17 15:07:14 +0000161 algorithms supplied by OpenSSL.
Gregory P. Smith3f61d612009-05-04 00:45:33 +0000162
Georg Brandl116aa622007-08-15 14:28:22 +0000163
164.. method:: hash.digest()
165
Georg Brandl67ced422007-09-06 14:09:10 +0000166 Return the digest of the data passed to the :meth:`update` method so far.
Senthil Kumaran627284c2010-12-30 07:07:58 +0000167 This is a bytes object of size :attr:`digest_size` which may contain bytes in
Georg Brandl67ced422007-09-06 14:09:10 +0000168 the whole range from 0 to 255.
Georg Brandl116aa622007-08-15 14:28:22 +0000169
170
171.. method:: hash.hexdigest()
172
Georg Brandl67ced422007-09-06 14:09:10 +0000173 Like :meth:`digest` except the digest is returned as a string object of
174 double length, containing only hexadecimal digits. This may be used to
175 exchange the value safely in email or other non-binary environments.
Georg Brandl116aa622007-08-15 14:28:22 +0000176
177
178.. method:: hash.copy()
179
180 Return a copy ("clone") of the hash object. This can be used to efficiently
Georg Brandl67ced422007-09-06 14:09:10 +0000181 compute the digests of data sharing a common initial substring.
Georg Brandl116aa622007-08-15 14:28:22 +0000182
183
Benjamin Petersonc402d8d2015-09-27 01:23:10 -0700184Key derivation
185--------------
Christian Heimese92ef132013-10-13 00:52:43 +0200186
187Key derivation and key stretching algorithms are designed for secure password
Benjamin Peterson0ccff4d2014-05-26 15:41:26 -0700188hashing. Naive algorithms such as ``sha1(password)`` are not resistant against
189brute-force attacks. A good password hashing function must be tunable, slow, and
Benjamin Peterson0d81d802014-05-26 15:42:29 -0700190include a `salt <https://en.wikipedia.org/wiki/Salt_%28cryptography%29>`_.
Christian Heimese92ef132013-10-13 00:52:43 +0200191
192
Martin Panterbc85e352016-02-22 09:21:49 +0000193.. function:: pbkdf2_hmac(hash_name, password, salt, iterations, dklen=None)
Christian Heimese92ef132013-10-13 00:52:43 +0200194
195 The function provides PKCS#5 password-based key derivation function 2. It
196 uses HMAC as pseudorandom function.
197
Martin Panterbc85e352016-02-22 09:21:49 +0000198 The string *hash_name* is the desired name of the hash digest algorithm for
Christian Heimese92ef132013-10-13 00:52:43 +0200199 HMAC, e.g. 'sha1' or 'sha256'. *password* and *salt* are interpreted as
200 buffers of bytes. Applications and libraries should limit *password* to
Martin Panterbc85e352016-02-22 09:21:49 +0000201 a sensible length (e.g. 1024). *salt* should be about 16 or more bytes from
Christian Heimese92ef132013-10-13 00:52:43 +0200202 a proper source, e.g. :func:`os.urandom`.
203
Martin Panterbc85e352016-02-22 09:21:49 +0000204 The number of *iterations* should be chosen based on the hash algorithm and
205 computing power. As of 2013, at least 100,000 iterations of SHA-256 are
206 suggested.
Christian Heimese92ef132013-10-13 00:52:43 +0200207
208 *dklen* is the length of the derived key. If *dklen* is ``None`` then the
Martin Panterbc85e352016-02-22 09:21:49 +0000209 digest size of the hash algorithm *hash_name* is used, e.g. 64 for SHA-512.
Christian Heimese92ef132013-10-13 00:52:43 +0200210
211 >>> import hashlib, binascii
212 >>> dk = hashlib.pbkdf2_hmac('sha256', b'password', b'salt', 100000)
213 >>> binascii.hexlify(dk)
214 b'0394a2ede332c9a13eb82e9b24631604c31df978b4e2f0fbd2c549944f9d79a5'
215
216 .. versionadded:: 3.4
217
Benjamin Petersonf9ea5f32014-05-26 15:45:14 -0700218 .. note::
219
220 A fast implementation of *pbkdf2_hmac* is available with OpenSSL. The
221 Python implementation uses an inline version of :mod:`hmac`. It is about
222 three times slower and doesn't release the GIL.
Christian Heimese92ef132013-10-13 00:52:43 +0200223
224
Georg Brandl116aa622007-08-15 14:28:22 +0000225.. seealso::
226
227 Module :mod:`hmac`
228 A module to generate message authentication codes using hashes.
229
230 Module :mod:`base64`
231 Another way to encode binary hashes for non-binary environments.
232
233 http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
234 The FIPS 180-2 publication on Secure Hash Algorithms.
235
Benjamin Peterson1dd72e62015-09-27 02:05:01 -0700236 https://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms
Georg Brandlfd0eb3f2010-05-21 20:28:13 +0000237 Wikipedia article with information on which algorithms have known issues and
Georg Brandl116aa622007-08-15 14:28:22 +0000238 what that means regarding their use.
239
Serhiy Storchaka6dff0202016-05-07 10:49:07 +0300240 https://www.ietf.org/rfc/rfc2898.txt
Christian Heimese92ef132013-10-13 00:52:43 +0200241 PKCS #5: Password-Based Cryptography Specification Version 2.0