blob: fa9582119b10a782a373d5eedecba8ca441539af [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
14This module implements a common interface to many different secure hash and
15message digest algorithms. Included are the FIPS secure hash algorithms SHA1,
16SHA224, SHA256, SHA384, and SHA512 (defined in FIPS 180-2) as well as RSA's MD5
Georg Brandl67ced422007-09-06 14:09:10 +000017algorithm (defined in Internet :rfc:`1321`). The terms "secure hash" and
18"message digest" are interchangeable. Older algorithms were called message
19digests. The modern term is secure hash.
Georg Brandl116aa622007-08-15 14:28:22 +000020
Christian Heimesd5e2b6f2008-03-19 21:50:51 +000021.. note::
22 If you want the adler32 or crc32 hash functions they are available in
23 the :mod:`zlib` module.
24
Georg Brandl116aa622007-08-15 14:28:22 +000025.. warning::
26
27 Some algorithms have known hash collision weaknesses, see the FAQ at the end.
28
29There is one constructor method named for each type of :dfn:`hash`. All return
30a hash object with the same simple interface. For example: use :func:`sha1` to
Georg Brandl67ced422007-09-06 14:09:10 +000031create a SHA1 hash object. You can now feed this object with objects conforming
32to the buffer interface (normally :class:`bytes` objects) using the
33:meth:`update` method. At any point you can ask it for the :dfn:`digest` of the
34concatenation of the data fed to it so far using the :meth:`digest` or
35:meth:`hexdigest` methods.
36
37.. note::
38
Antoine Pitroubcd5cbe2009-01-08 21:17:16 +000039 For better multithreading performance, the Python GIL is released for
40 strings of more than 2047 bytes at object creation or on update.
41
42.. note::
43
Georg Brandl67ced422007-09-06 14:09:10 +000044 Feeding string objects is to :meth:`update` is not supported, as hashes work
45 on bytes, not on characters.
Georg Brandl116aa622007-08-15 14:28:22 +000046
Thomas Wouters1b7f8912007-09-19 03:06:30 +000047.. index:: single: OpenSSL; (use in module hashlib)
Georg Brandl116aa622007-08-15 14:28:22 +000048
49Constructors for hash algorithms that are always present in this module are
50:func:`md5`, :func:`sha1`, :func:`sha224`, :func:`sha256`, :func:`sha384`, and
51:func:`sha512`. Additional algorithms may also be available depending upon the
52OpenSSL library that Python uses on your platform.
53
Georg Brandl67ced422007-09-06 14:09:10 +000054For example, to obtain the digest of the byte string ``b'Nobody inspects the
55spammish repetition'``::
Georg Brandl116aa622007-08-15 14:28:22 +000056
57 >>> import hashlib
58 >>> m = hashlib.md5()
Georg Brandl67ced422007-09-06 14:09:10 +000059 >>> m.update(b"Nobody inspects")
60 >>> m.update(b" the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +000061 >>> m.digest()
Georg Brandl67ced422007-09-06 14:09:10 +000062 b'\xbbd\x9c\x83\xdd\x1e\xa5\xc9\xd9\xde\xc9\xa1\x8d\xf0\xff\xe9'
Guido van Rossuma19f80c2007-11-06 20:51:31 +000063 >>> m.digest_size
64 16
65 >>> m.block_size
66 64
Georg Brandl116aa622007-08-15 14:28:22 +000067
Christian Heimesfe337bf2008-03-23 21:54:12 +000068More condensed:
Georg Brandl116aa622007-08-15 14:28:22 +000069
Georg Brandl67ced422007-09-06 14:09:10 +000070 >>> hashlib.sha224(b"Nobody inspects the spammish repetition").hexdigest()
Benjamin Peterson0fa3f3d2008-12-29 20:52:09 +000071 'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2'
Georg Brandl116aa622007-08-15 14:28:22 +000072
Gregory P. Smith13b55292010-09-06 08:30:23 +000073.. function:: new(name[, data])
74
75 Is a generic constructor that takes the string name of the desired
76 algorithm as its first parameter. It also exists to allow access to the
77 above listed hashes as well as any other algorithms that your OpenSSL
78 library may offer. The named constructors are much faster than :func:`new`
79 and should be preferred.
Georg Brandl116aa622007-08-15 14:28:22 +000080
Christian Heimesfe337bf2008-03-23 21:54:12 +000081Using :func:`new` with an algorithm provided by OpenSSL:
Georg Brandl116aa622007-08-15 14:28:22 +000082
83 >>> h = hashlib.new('ripemd160')
Georg Brandl67ced422007-09-06 14:09:10 +000084 >>> h.update(b"Nobody inspects the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +000085 >>> h.hexdigest()
Benjamin Peterson0fa3f3d2008-12-29 20:52:09 +000086 'cc4a5ce1b3df48aec5d22d1f16b894a0b894eccc'
Georg Brandl116aa622007-08-15 14:28:22 +000087
Gregory P. Smith13b55292010-09-06 08:30:23 +000088Hashlib provides the following constant attributes:
Gregory P. Smith86508cc2010-03-01 02:05:26 +000089
Gregory P. Smith13b55292010-09-06 08:30:23 +000090.. data:: algorithms_guaranteed
Gregory P. Smith86508cc2010-03-01 02:05:26 +000091
Gregory P. Smith13b55292010-09-06 08:30:23 +000092 Contains the names of the hash algorithms guaranteed to be supported
93 by this module on all platforms.
94
95 .. versionadded:: 3.2
96
97.. data:: algorithms_available
98
99 Contains the names of the hash algorithms that are available
100 in the running Python interpreter. These names will be recognized
101 when passed to :func:`new`. :attr:`algorithms_guaranteed`
102 will always be a subset. Duplicate algorithms with different
103 name formats may appear in this set (thanks to OpenSSL).
Gregory P. Smith86508cc2010-03-01 02:05:26 +0000104
105 .. versionadded:: 3.2
106
Georg Brandl116aa622007-08-15 14:28:22 +0000107The following values are provided as constant attributes of the hash objects
108returned by the constructors:
109
110
Benjamin Peterson4ac9ce42009-10-04 14:49:41 +0000111.. data:: hash.digest_size
Georg Brandl116aa622007-08-15 14:28:22 +0000112
Guido van Rossuma19f80c2007-11-06 20:51:31 +0000113 The size of the resulting hash in bytes.
114
Benjamin Peterson4ac9ce42009-10-04 14:49:41 +0000115.. data:: hash.block_size
Guido van Rossuma19f80c2007-11-06 20:51:31 +0000116
117 The internal block size of the hash algorithm in bytes.
Georg Brandl116aa622007-08-15 14:28:22 +0000118
119A hash object has the following methods:
120
121
122.. method:: hash.update(arg)
123
Georg Brandl67ced422007-09-06 14:09:10 +0000124 Update the hash object with the object *arg*, which must be interpretable as
125 a buffer of bytes. Repeated calls are equivalent to a single call with the
126 concatenation of all the arguments: ``m.update(a); m.update(b)`` is
127 equivalent to ``m.update(a+b)``.
Georg Brandl116aa622007-08-15 14:28:22 +0000128
Georg Brandl705d9d52009-05-05 09:29:50 +0000129 .. versionchanged:: 3.1
Georg Brandl67b21b72010-08-17 15:07:14 +0000130 The Python GIL is released to allow other threads to run while hash
131 updates on data larger than 2048 bytes is taking place when using hash
132 algorithms supplied by OpenSSL.
Gregory P. Smith3f61d612009-05-04 00:45:33 +0000133
Georg Brandl116aa622007-08-15 14:28:22 +0000134
135.. method:: hash.digest()
136
Georg Brandl67ced422007-09-06 14:09:10 +0000137 Return the digest of the data passed to the :meth:`update` method so far.
138 This is a bytes array of size :attr:`digest_size` which may contain bytes in
139 the whole range from 0 to 255.
Georg Brandl116aa622007-08-15 14:28:22 +0000140
141
142.. method:: hash.hexdigest()
143
Georg Brandl67ced422007-09-06 14:09:10 +0000144 Like :meth:`digest` except the digest is returned as a string object of
145 double length, containing only hexadecimal digits. This may be used to
146 exchange the value safely in email or other non-binary environments.
Georg Brandl116aa622007-08-15 14:28:22 +0000147
148
149.. method:: hash.copy()
150
151 Return a copy ("clone") of the hash object. This can be used to efficiently
Georg Brandl67ced422007-09-06 14:09:10 +0000152 compute the digests of data sharing a common initial substring.
Georg Brandl116aa622007-08-15 14:28:22 +0000153
154
155.. seealso::
156
157 Module :mod:`hmac`
158 A module to generate message authentication codes using hashes.
159
160 Module :mod:`base64`
161 Another way to encode binary hashes for non-binary environments.
162
163 http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
164 The FIPS 180-2 publication on Secure Hash Algorithms.
165
Georg Brandlfd0eb3f2010-05-21 20:28:13 +0000166 http://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms
167 Wikipedia article with information on which algorithms have known issues and
Georg Brandl116aa622007-08-15 14:28:22 +0000168 what that means regarding their use.
169