hashlib.rst 8.02 KB
Newer Older
1 2 3 4 5
:mod:`hashlib` --- Secure hashes and message digests
====================================================

.. module:: hashlib
   :synopsis: Secure hash and message digest algorithms.
Benjamin Peterson's avatar
Benjamin Peterson committed
6 7
.. moduleauthor:: Gregory P. Smith <greg@krypto.org>
.. sectionauthor:: Gregory P. Smith <greg@krypto.org>
8 9 10 11 12 13


.. index::
   single: message digest, MD5
   single: secure hash algorithm, SHA1, SHA224, SHA256, SHA384, SHA512

Raymond Hettinger's avatar
Raymond Hettinger committed
14 15 16 17
**Source code:** :source:`Lib/hashlib.py`

--------------

18 19 20
This module implements a common interface to many different secure hash and
message digest algorithms.  Included are the FIPS secure hash algorithms SHA1,
SHA224, SHA256, SHA384, and SHA512 (defined in FIPS 180-2) as well as RSA's MD5
21 22 23
algorithm (defined in Internet :rfc:`1321`).  The terms "secure hash" and
"message digest" are interchangeable.  Older algorithms were called message
digests.  The modern term is secure hash.
24

Christian Heimes's avatar
Christian Heimes committed
25
.. note::
26 27

   If you want the adler32 or crc32 hash functions, they are available in
Christian Heimes's avatar
Christian Heimes committed
28 29
   the :mod:`zlib` module.

30 31
.. warning::

32 33
   Some algorithms have known hash collision weaknesses, refer to the "See
   also" section at the end.
34

35

36 37
.. _hash-algorithms:

38 39 40
Hash algorithms
---------------

41 42
There is one constructor method named for each type of :dfn:`hash`.  All return
a hash object with the same simple interface. For example: use :func:`sha1` to
43 44 45
create a SHA1 hash object. You can now feed this object with :term:`bytes-like
object`\ s (normally :class:`bytes`) using the :meth:`update` method.
At any point you can ask it for the :dfn:`digest` of the
46 47 48
concatenation of the data fed to it so far using the :meth:`digest` or
:meth:`hexdigest` methods.

49 50
.. note::

51
   For better multithreading performance, the Python :term:`GIL` is released for
52
   data larger than 2047 bytes at object creation or on update.
53

54 55
.. note::

Benjamin Peterson's avatar
Benjamin Peterson committed
56
   Feeding string objects into :meth:`update` is not supported, as hashes work
57
   on bytes, not on characters.
58

59
.. index:: single: OpenSSL; (use in module hashlib)
60 61

Constructors for hash algorithms that are always present in this module are
62
:func:`md5`, :func:`sha1`, :func:`sha224`, :func:`sha256`, :func:`sha384`,
63
and :func:`sha512`. Additional algorithms may also be available depending upon
64 65
the OpenSSL library that Python uses on your platform.

66 67
For example, to obtain the digest of the byte string ``b'Nobody inspects the
spammish repetition'``::
68 69 70

   >>> import hashlib
   >>> m = hashlib.md5()
71 72
   >>> m.update(b"Nobody inspects")
   >>> m.update(b" the spammish repetition")
73
   >>> m.digest()
74
   b'\xbbd\x9c\x83\xdd\x1e\xa5\xc9\xd9\xde\xc9\xa1\x8d\xf0\xff\xe9'
75 76 77 78
   >>> m.digest_size
   16
   >>> m.block_size
   64
79

Christian Heimes's avatar
Christian Heimes committed
80
More condensed:
81

82
   >>> hashlib.sha224(b"Nobody inspects the spammish repetition").hexdigest()
83
   'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2'
84

85 86 87 88 89 90 91
.. function:: new(name[, data])

   Is a generic constructor that takes the string name of the desired
   algorithm as its first parameter.  It also exists to allow access to the
   above listed hashes as well as any other algorithms that your OpenSSL
   library may offer.  The named constructors are much faster than :func:`new`
   and should be preferred.
92

Christian Heimes's avatar
Christian Heimes committed
93
Using :func:`new` with an algorithm provided by OpenSSL:
94 95

   >>> h = hashlib.new('ripemd160')
96
   >>> h.update(b"Nobody inspects the spammish repetition")
97
   >>> h.hexdigest()
98
   'cc4a5ce1b3df48aec5d22d1f16b894a0b894eccc'
99

100 101 102 103
Hashlib provides the following constant attributes:

.. data:: algorithms_guaranteed

104
   A set containing the names of the hash algorithms guaranteed to be supported
105 106 107
   by this module on all platforms.

   .. versionadded:: 3.2
108

109
.. data:: algorithms_available
110

111 112 113 114 115
   A set containing the names of the hash algorithms that are available in the
   running Python interpreter.  These names will be recognized when passed to
   :func:`new`.  :attr:`algorithms_guaranteed` will always be a subset.  The
   same algorithm may appear multiple times in this set under different names
   (thanks to OpenSSL).
116 117 118

   .. versionadded:: 3.2

119 120 121 122
The following values are provided as constant attributes of the hash objects
returned by the constructors:


Benjamin Peterson's avatar
Benjamin Peterson committed
123
.. data:: hash.digest_size
124

125 126
   The size of the resulting hash in bytes.

Benjamin Peterson's avatar
Benjamin Peterson committed
127
.. data:: hash.block_size
128 129

   The internal block size of the hash algorithm in bytes.
130

131 132 133 134 135 136 137 138 139 140 141 142
A hash object has the following attributes:

.. attribute:: hash.name

   The canonical name of this hash, always lowercase and always suitable as a
   parameter to :func:`new` to create another hash of this type.

   .. versionchanged:: 3.4
      The name attribute has been present in CPython since its inception, but
      until Python 3.4 was not formally specified, so may not exist on some
      platforms.

143 144 145 146 147
A hash object has the following methods:


.. method:: hash.update(arg)

148 149 150 151
   Update the hash object with the object *arg*, which must be interpretable as
   a buffer of bytes.  Repeated calls are equivalent to a single call with the
   concatenation of all the arguments: ``m.update(a); m.update(b)`` is
   equivalent to ``m.update(a+b)``.
152

153
   .. versionchanged:: 3.1
154
      The Python GIL is released to allow other threads to run while hash
155
      updates on data larger than 2047 bytes is taking place when using hash
156
      algorithms supplied by OpenSSL.
157

158 159 160

.. method:: hash.digest()

161
   Return the digest of the data passed to the :meth:`update` method so far.
162
   This is a bytes object of size :attr:`digest_size` which may contain bytes in
163
   the whole range from 0 to 255.
164 165 166 167


.. method:: hash.hexdigest()

168 169 170
   Like :meth:`digest` except the digest is returned as a string object of
   double length, containing only hexadecimal digits.  This may be used to
   exchange the value safely in email or other non-binary environments.
171 172 173 174 175


.. method:: hash.copy()

   Return a copy ("clone") of the hash object.  This can be used to efficiently
176
   compute the digests of data sharing a common initial substring.
177 178


179 180 181 182
Key Derivation Function
-----------------------

Key derivation and key stretching algorithms are designed for secure password
Benjamin Peterson's avatar
Benjamin Peterson committed
183 184
hashing. Naive algorithms such as ``sha1(password)`` are not resistant against
brute-force attacks. A good password hashing function must be tunable, slow, and
185
include a `salt <https://en.wikipedia.org/wiki/Salt_%28cryptography%29>`_.
186 187 188 189 190 191 192 193 194 195 196 197 198 199


.. function:: pbkdf2_hmac(name, password, salt, rounds, dklen=None)

   The function provides PKCS#5 password-based key derivation function 2. It
   uses HMAC as pseudorandom function.

   The string *name* is the desired name of the hash digest algorithm for
   HMAC, e.g. 'sha1' or 'sha256'. *password* and *salt* are interpreted as
   buffers of bytes. Applications and libraries should limit *password* to
   a sensible value (e.g. 1024). *salt* should be about 16 or more bytes from
   a proper source, e.g. :func:`os.urandom`.

   The number of *rounds* should be chosen based on the hash algorithm and
200
   computing power. As of 2013, at least 100,000 rounds of SHA-256 is suggested.
201 202 203 204 205 206 207 208 209 210 211

   *dklen* is the length of the derived key. If *dklen* is ``None`` then the
   digest size of the hash algorithm *name* is used, e.g. 64 for SHA-512.

   >>> import hashlib, binascii
   >>> dk = hashlib.pbkdf2_hmac('sha256', b'password', b'salt', 100000)
   >>> binascii.hexlify(dk)
   b'0394a2ede332c9a13eb82e9b24631604c31df978b4e2f0fbd2c549944f9d79a5'

   .. versionadded:: 3.4

212 213 214 215 216
   .. note::

      A fast implementation of *pbkdf2_hmac* is available with OpenSSL.  The
      Python implementation uses an inline version of :mod:`hmac`. It is about
      three times slower and doesn't release the GIL.
217 218


219 220 221 222 223 224 225 226 227 228 229
.. seealso::

   Module :mod:`hmac`
      A module to generate message authentication codes using hashes.

   Module :mod:`base64`
      Another way to encode binary hashes for non-binary environments.

   http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
      The FIPS 180-2 publication on Secure Hash Algorithms.

230 231
   http://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms
      Wikipedia article with information on which algorithms have known issues and
232 233
      what that means regarding their use.

234 235
   http://www.ietf.org/rfc/rfc2898.txt
      PKCS #5: Password-Based Cryptography Specification Version 2.0