blob: a725e076dfd2f32dc907639c749b3ea340533749 [file] [log] [blame]
Georg Brandl116aa622007-08-15 14:28:22 +00001
2:mod:`hashlib` --- Secure hashes and message digests
3====================================================
4
5.. module:: hashlib
6 :synopsis: Secure hash and message digest algorithms.
7.. moduleauthor:: Gregory P. Smith <greg@users.sourceforge.net>
8.. sectionauthor:: Gregory P. Smith <greg@users.sourceforge.net>
9
10
Georg Brandl116aa622007-08-15 14:28:22 +000011.. index::
12 single: message digest, MD5
13 single: secure hash algorithm, SHA1, SHA224, SHA256, SHA384, SHA512
14
15This module implements a common interface to many different secure hash and
16message digest algorithms. Included are the FIPS secure hash algorithms SHA1,
17SHA224, SHA256, SHA384, and SHA512 (defined in FIPS 180-2) as well as RSA's MD5
Georg Brandl67ced422007-09-06 14:09:10 +000018algorithm (defined in Internet :rfc:`1321`). The terms "secure hash" and
19"message digest" are interchangeable. Older algorithms were called message
20digests. The modern term is secure hash.
Georg Brandl116aa622007-08-15 14:28:22 +000021
22.. warning::
23
24 Some algorithms have known hash collision weaknesses, see the FAQ at the end.
25
26There is one constructor method named for each type of :dfn:`hash`. All return
27a hash object with the same simple interface. For example: use :func:`sha1` to
Georg Brandl67ced422007-09-06 14:09:10 +000028create a SHA1 hash object. You can now feed this object with objects conforming
29to the buffer interface (normally :class:`bytes` objects) using the
30:meth:`update` method. At any point you can ask it for the :dfn:`digest` of the
31concatenation of the data fed to it so far using the :meth:`digest` or
32:meth:`hexdigest` methods.
33
34.. note::
35
36 Feeding string objects is to :meth:`update` is not supported, as hashes work
37 on bytes, not on characters.
Georg Brandl116aa622007-08-15 14:28:22 +000038
Thomas Wouters1b7f8912007-09-19 03:06:30 +000039.. index:: single: OpenSSL; (use in module hashlib)
Georg Brandl116aa622007-08-15 14:28:22 +000040
41Constructors for hash algorithms that are always present in this module are
42:func:`md5`, :func:`sha1`, :func:`sha224`, :func:`sha256`, :func:`sha384`, and
43:func:`sha512`. Additional algorithms may also be available depending upon the
44OpenSSL library that Python uses on your platform.
45
Georg Brandl67ced422007-09-06 14:09:10 +000046For example, to obtain the digest of the byte string ``b'Nobody inspects the
47spammish repetition'``::
Georg Brandl116aa622007-08-15 14:28:22 +000048
49 >>> import hashlib
50 >>> m = hashlib.md5()
Georg Brandl67ced422007-09-06 14:09:10 +000051 >>> m.update(b"Nobody inspects")
52 >>> m.update(b" the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +000053 >>> m.digest()
Georg Brandl67ced422007-09-06 14:09:10 +000054 b'\xbbd\x9c\x83\xdd\x1e\xa5\xc9\xd9\xde\xc9\xa1\x8d\xf0\xff\xe9'
Guido van Rossuma19f80c2007-11-06 20:51:31 +000055 >>> m.digest_size
56 16
57 >>> m.block_size
58 64
Georg Brandl116aa622007-08-15 14:28:22 +000059
60More condensed::
61
Georg Brandl67ced422007-09-06 14:09:10 +000062 >>> hashlib.sha224(b"Nobody inspects the spammish repetition").hexdigest()
63 b'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2'
Georg Brandl116aa622007-08-15 14:28:22 +000064
65A generic :func:`new` constructor that takes the string name of the desired
66algorithm as its first parameter also exists to allow access to the above listed
67hashes as well as any other algorithms that your OpenSSL library may offer. The
68named constructors are much faster than :func:`new` and should be preferred.
69
70Using :func:`new` with an algorithm provided by OpenSSL::
71
72 >>> h = hashlib.new('ripemd160')
Georg Brandl67ced422007-09-06 14:09:10 +000073 >>> h.update(b"Nobody inspects the spammish repetition")
Georg Brandl116aa622007-08-15 14:28:22 +000074 >>> h.hexdigest()
Georg Brandl67ced422007-09-06 14:09:10 +000075 b'cc4a5ce1b3df48aec5d22d1f16b894a0b894eccc'
Georg Brandl116aa622007-08-15 14:28:22 +000076
77The following values are provided as constant attributes of the hash objects
78returned by the constructors:
79
80
81.. data:: digest_size
82
Guido van Rossuma19f80c2007-11-06 20:51:31 +000083 The size of the resulting hash in bytes.
84
85.. data:: block_size
86
87 The internal block size of the hash algorithm in bytes.
Georg Brandl116aa622007-08-15 14:28:22 +000088
89A hash object has the following methods:
90
91
92.. method:: hash.update(arg)
93
Georg Brandl67ced422007-09-06 14:09:10 +000094 Update the hash object with the object *arg*, which must be interpretable as
95 a buffer of bytes. Repeated calls are equivalent to a single call with the
96 concatenation of all the arguments: ``m.update(a); m.update(b)`` is
97 equivalent to ``m.update(a+b)``.
Georg Brandl116aa622007-08-15 14:28:22 +000098
99
100.. method:: hash.digest()
101
Georg Brandl67ced422007-09-06 14:09:10 +0000102 Return the digest of the data passed to the :meth:`update` method so far.
103 This is a bytes array of size :attr:`digest_size` which may contain bytes in
104 the whole range from 0 to 255.
Georg Brandl116aa622007-08-15 14:28:22 +0000105
106
107.. method:: hash.hexdigest()
108
Georg Brandl67ced422007-09-06 14:09:10 +0000109 Like :meth:`digest` except the digest is returned as a string object of
110 double length, containing only hexadecimal digits. This may be used to
111 exchange the value safely in email or other non-binary environments.
Georg Brandl116aa622007-08-15 14:28:22 +0000112
113
114.. method:: hash.copy()
115
116 Return a copy ("clone") of the hash object. This can be used to efficiently
Georg Brandl67ced422007-09-06 14:09:10 +0000117 compute the digests of data sharing a common initial substring.
Georg Brandl116aa622007-08-15 14:28:22 +0000118
119
120.. seealso::
121
122 Module :mod:`hmac`
123 A module to generate message authentication codes using hashes.
124
125 Module :mod:`base64`
126 Another way to encode binary hashes for non-binary environments.
127
128 http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
129 The FIPS 180-2 publication on Secure Hash Algorithms.
130
131 http://www.cryptography.com/cnews/hash.html
132 Hash Collision FAQ with information on which algorithms have known issues and
133 what that means regarding their use.
134