blob: db41db4ba50dc8773e41e9339f3e7350a1c7a617 [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.
Benjamin Peterson058e31e2009-01-16 03:54:08 +00006.. moduleauthor:: Gregory P. Smith <greg@krypto.org>
7.. sectionauthor:: Gregory P. Smith <greg@krypto.org>
Georg Brandl116aa622007-08-15 14:28:22 +00008
9
Georg Brandl116aa622007-08-15 14:28:22 +000010.. index::
11 single: message digest, MD5
12 single: secure hash algorithm, SHA1, SHA224, SHA256, SHA384, SHA512
13
Raymond Hettinger469271d2011-01-27 20:38:46 +000014**Source code:** :source:`Lib/hashlib.py`
15
16--------------
17
Georg Brandl116aa622007-08-15 14:28:22 +000018This module implements a common interface to many different secure hash and
19message digest algorithms. Included are the FIPS secure hash algorithms SHA1,
20SHA224, SHA256, SHA384, and SHA512 (defined in FIPS 180-2) as well as RSA's MD5
Georg Brandl67ced422007-09-06 14:09:10 +000021algorithm (defined in Internet :rfc:`1321`). The terms "secure hash" and
22"message digest" are interchangeable. Older algorithms were called message
23digests. The modern term is secure hash.
Georg Brandl116aa622007-08-15 14:28:22 +000024
Christian Heimesd5e2b6f2008-03-19 21:50:51 +000025.. note::
26 If you want the adler32 or crc32 hash functions they are available in
27 the :mod:`zlib` module.
28
Georg Brandl116aa622007-08-15 14:28:22 +000029.. warning::
30
31 Some algorithms have known hash collision weaknesses, see the FAQ at the end.
32
33There is one constructor method named for each type of :dfn:`hash`. All return
34a hash object with the same simple interface. For example: use :func:`sha1` to
Ezio Melottic228e962013-05-04 18:06:34 +030035create a SHA1 hash object. You can now feed this object with :term:`bytes-like
36object`\ s (normally :class:`bytes`) using the :meth:`update` method.
37At any point you can ask it for the :dfn:`digest` of the
Georg Brandl67ced422007-09-06 14:09:10 +000038concatenation of the data fed to it so far using the :meth:`digest` or
39:meth:`hexdigest` methods.
40
41.. note::
42
Benjamin Peterson9cb7bd22012-12-20 20:24:37 -060043 For better multithreading performance, the Python :term:`GIL` is released for
Antoine Pitroubcd5cbe2009-01-08 21:17:16 +000044 strings of more than 2047 bytes at object creation or on update.
45
46.. note::
47
Benjamin Petersonbd584d52012-12-20 20:22:47 -060048 Feeding string objects into :meth:`update` is not supported, as hashes work
Georg Brandl67ced422007-09-06 14:09:10 +000049 on bytes, not on characters.
Georg Brandl116aa622007-08-15 14:28:22 +000050
Thomas Wouters1b7f8912007-09-19 03:06:30 +000051.. index:: single: OpenSSL; (use in module hashlib)
Georg Brandl116aa622007-08-15 14:28:22 +000052
53Constructors for hash algorithms that are always present in this module are
Christian Heimes4a0270d2012-10-06 02:23:36 +020054:func:`md5`, :func:`sha1`, :func:`sha224`, :func:`sha256`, :func:`sha384`,
55:func:`sha512`, :func:`sha3_224`, :func:`sha3_256`, :func:`sha3_384`, and
56:func:`sha3_512`. Additional algorithms may also be available depending upon
57the OpenSSL library that Python uses on your platform.
58
59 .. versionchanged:: 3.4
60 Add sha3 family of hash algorithms.
Georg Brandl116aa622007-08-15 14:28:22 +000061
Georg Brandl67ced422007-09-06 14:09:10 +000062For example, to obtain the digest of the byte string ``b'Nobody inspects the
63spammish repetition'``::
Georg Brandl116aa622007-08-15 14:28:22 +000064
65 >>> import hashlib
66 >>> m = hashlib.md5()
Georg Brandl67ced422007-09-06 14:09:10 +000067 >>> m.update(b"Nobody inspects")
68 >>> m.update(b" the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +000069 >>> m.digest()
Georg Brandl67ced422007-09-06 14:09:10 +000070 b'\xbbd\x9c\x83\xdd\x1e\xa5\xc9\xd9\xde\xc9\xa1\x8d\xf0\xff\xe9'
Guido van Rossuma19f80c2007-11-06 20:51:31 +000071 >>> m.digest_size
72 16
73 >>> m.block_size
74 64
Georg Brandl116aa622007-08-15 14:28:22 +000075
Christian Heimesfe337bf2008-03-23 21:54:12 +000076More condensed:
Georg Brandl116aa622007-08-15 14:28:22 +000077
Georg Brandl67ced422007-09-06 14:09:10 +000078 >>> hashlib.sha224(b"Nobody inspects the spammish repetition").hexdigest()
Benjamin Peterson0fa3f3d2008-12-29 20:52:09 +000079 'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2'
Georg Brandl116aa622007-08-15 14:28:22 +000080
Gregory P. Smith13b55292010-09-06 08:30:23 +000081.. function:: new(name[, data])
82
83 Is a generic constructor that takes the string name of the desired
84 algorithm as its first parameter. It also exists to allow access to the
85 above listed hashes as well as any other algorithms that your OpenSSL
86 library may offer. The named constructors are much faster than :func:`new`
87 and should be preferred.
Georg Brandl116aa622007-08-15 14:28:22 +000088
Christian Heimesfe337bf2008-03-23 21:54:12 +000089Using :func:`new` with an algorithm provided by OpenSSL:
Georg Brandl116aa622007-08-15 14:28:22 +000090
91 >>> h = hashlib.new('ripemd160')
Georg Brandl67ced422007-09-06 14:09:10 +000092 >>> h.update(b"Nobody inspects the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +000093 >>> h.hexdigest()
Benjamin Peterson0fa3f3d2008-12-29 20:52:09 +000094 'cc4a5ce1b3df48aec5d22d1f16b894a0b894eccc'
Georg Brandl116aa622007-08-15 14:28:22 +000095
Gregory P. Smith13b55292010-09-06 08:30:23 +000096Hashlib provides the following constant attributes:
Gregory P. Smith86508cc2010-03-01 02:05:26 +000097
Gregory P. Smith13b55292010-09-06 08:30:23 +000098.. data:: algorithms_guaranteed
Gregory P. Smith86508cc2010-03-01 02:05:26 +000099
Gregory P. Smith13b55292010-09-06 08:30:23 +0000100 Contains the names of the hash algorithms guaranteed to be supported
101 by this module on all platforms.
102
103 .. versionadded:: 3.2
104
105.. data:: algorithms_available
106
107 Contains the names of the hash algorithms that are available
108 in the running Python interpreter. These names will be recognized
109 when passed to :func:`new`. :attr:`algorithms_guaranteed`
110 will always be a subset. Duplicate algorithms with different
111 name formats may appear in this set (thanks to OpenSSL).
Gregory P. Smith86508cc2010-03-01 02:05:26 +0000112
113 .. versionadded:: 3.2
114
Georg Brandl116aa622007-08-15 14:28:22 +0000115The following values are provided as constant attributes of the hash objects
116returned by the constructors:
117
118
Benjamin Peterson4ac9ce42009-10-04 14:49:41 +0000119.. data:: hash.digest_size
Georg Brandl116aa622007-08-15 14:28:22 +0000120
Guido van Rossuma19f80c2007-11-06 20:51:31 +0000121 The size of the resulting hash in bytes.
122
Benjamin Peterson4ac9ce42009-10-04 14:49:41 +0000123.. data:: hash.block_size
Guido van Rossuma19f80c2007-11-06 20:51:31 +0000124
125 The internal block size of the hash algorithm in bytes.
Georg Brandl116aa622007-08-15 14:28:22 +0000126
Jason R. Coombsb2aa6f42013-08-03 11:39:39 +0200127A hash object has the following attributes:
128
129.. attribute:: hash.name
130
131 The canonical name of this hash, always lowercase and always suitable as a
132 parameter to :func:`new` to create another hash of this type.
133
134 .. versionchanged:: 3.4
135 The name attribute has been present in CPython since its inception, but
136 until Python 3.4 was not formally specified, so may not exist on some
137 platforms.
138
Georg Brandl116aa622007-08-15 14:28:22 +0000139A hash object has the following methods:
140
141
142.. method:: hash.update(arg)
143
Georg Brandl67ced422007-09-06 14:09:10 +0000144 Update the hash object with the object *arg*, which must be interpretable as
145 a buffer of bytes. Repeated calls are equivalent to a single call with the
146 concatenation of all the arguments: ``m.update(a); m.update(b)`` is
147 equivalent to ``m.update(a+b)``.
Georg Brandl116aa622007-08-15 14:28:22 +0000148
Georg Brandl705d9d52009-05-05 09:29:50 +0000149 .. versionchanged:: 3.1
Georg Brandl67b21b72010-08-17 15:07:14 +0000150 The Python GIL is released to allow other threads to run while hash
151 updates on data larger than 2048 bytes is taking place when using hash
152 algorithms supplied by OpenSSL.
Gregory P. Smith3f61d612009-05-04 00:45:33 +0000153
Georg Brandl116aa622007-08-15 14:28:22 +0000154
155.. method:: hash.digest()
156
Georg Brandl67ced422007-09-06 14:09:10 +0000157 Return the digest of the data passed to the :meth:`update` method so far.
Senthil Kumaran627284c2010-12-30 07:07:58 +0000158 This is a bytes object of size :attr:`digest_size` which may contain bytes in
Georg Brandl67ced422007-09-06 14:09:10 +0000159 the whole range from 0 to 255.
Georg Brandl116aa622007-08-15 14:28:22 +0000160
161
162.. method:: hash.hexdigest()
163
Georg Brandl67ced422007-09-06 14:09:10 +0000164 Like :meth:`digest` except the digest is returned as a string object of
165 double length, containing only hexadecimal digits. This may be used to
166 exchange the value safely in email or other non-binary environments.
Georg Brandl116aa622007-08-15 14:28:22 +0000167
168
169.. method:: hash.copy()
170
171 Return a copy ("clone") of the hash object. This can be used to efficiently
Georg Brandl67ced422007-09-06 14:09:10 +0000172 compute the digests of data sharing a common initial substring.
Georg Brandl116aa622007-08-15 14:28:22 +0000173
174
175.. seealso::
176
177 Module :mod:`hmac`
178 A module to generate message authentication codes using hashes.
179
180 Module :mod:`base64`
181 Another way to encode binary hashes for non-binary environments.
182
183 http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
184 The FIPS 180-2 publication on Secure Hash Algorithms.
185
Georg Brandlfd0eb3f2010-05-21 20:28:13 +0000186 http://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms
187 Wikipedia article with information on which algorithms have known issues and
Georg Brandl116aa622007-08-15 14:28:22 +0000188 what that means regarding their use.
189