| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 1 | :mod:`hashlib` --- Secure hashes and message digests | 
|  | 2 | ==================================================== | 
|  | 3 |  | 
|  | 4 | .. module:: hashlib | 
|  | 5 | :synopsis: Secure hash and message digest algorithms. | 
| Gregory P. Smith | 26f8d1b | 2009-01-11 17:53:33 +0000 | [diff] [blame] | 6 | .. moduleauthor:: Gregory P. Smith <greg@krypto.org> | 
|  | 7 | .. sectionauthor:: Gregory P. Smith <greg@krypto.org> | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 8 |  | 
|  | 9 |  | 
|  | 10 | .. versionadded:: 2.5 | 
|  | 11 |  | 
|  | 12 | .. index:: | 
|  | 13 | single: message digest, MD5 | 
|  | 14 | single: secure hash algorithm, SHA1, SHA224, SHA256, SHA384, SHA512 | 
|  | 15 |  | 
| Éric Araujo | 29a0b57 | 2011-08-19 02:14:03 +0200 | [diff] [blame] | 16 | **Source code:** :source:`Lib/hashlib.py` | 
|  | 17 |  | 
|  | 18 | -------------- | 
|  | 19 |  | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 20 | This module implements a common interface to many different secure hash and | 
|  | 21 | message digest algorithms.  Included are the FIPS secure hash algorithms SHA1, | 
|  | 22 | SHA224, SHA256, SHA384, and SHA512 (defined in FIPS 180-2) as well as RSA's MD5 | 
|  | 23 | algorithm (defined in Internet :rfc:`1321`). The terms secure hash and message | 
|  | 24 | digest are interchangeable.  Older algorithms were called message digests.  The | 
|  | 25 | modern term is secure hash. | 
|  | 26 |  | 
| Gregory P. Smith | bde4007 | 2008-03-19 01:38:35 +0000 | [diff] [blame] | 27 | .. note:: | 
| Georg Brandl | 917bb8c | 2013-10-06 18:26:36 +0200 | [diff] [blame^] | 28 |  | 
|  | 29 | If you want the adler32 or crc32 hash functions, they are available in | 
| Gregory P. Smith | bde4007 | 2008-03-19 01:38:35 +0000 | [diff] [blame] | 30 | the :mod:`zlib` module. | 
|  | 31 |  | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 32 | .. warning:: | 
|  | 33 |  | 
| Georg Brandl | 917bb8c | 2013-10-06 18:26:36 +0200 | [diff] [blame^] | 34 | Some algorithms have known hash collision weaknesses, refer to the "See | 
|  | 35 | also" section at the end. | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 36 |  | 
|  | 37 | There is one constructor method named for each type of :dfn:`hash`.  All return | 
|  | 38 | a hash object with the same simple interface. For example: use :func:`sha1` to | 
|  | 39 | create a SHA1 hash object. You can now feed this object with arbitrary strings | 
|  | 40 | using the :meth:`update` method.  At any point you can ask it for the | 
|  | 41 | :dfn:`digest` of the concatenation of the strings fed to it so far using the | 
|  | 42 | :meth:`digest` or :meth:`hexdigest` methods. | 
|  | 43 |  | 
| Bill Janssen | 98d19da | 2007-09-10 21:51:02 +0000 | [diff] [blame] | 44 | .. index:: single: OpenSSL; (use in module hashlib) | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 45 |  | 
|  | 46 | Constructors for hash algorithms that are always present in this module are | 
|  | 47 | :func:`md5`, :func:`sha1`, :func:`sha224`, :func:`sha256`, :func:`sha384`, and | 
|  | 48 | :func:`sha512`.  Additional algorithms may also be available depending upon the | 
|  | 49 | OpenSSL library that Python uses on your platform. | 
|  | 50 |  | 
|  | 51 | For example, to obtain the digest of the string ``'Nobody inspects the spammish | 
| Georg Brandl | e8f1b00 | 2008-03-22 22:04:10 +0000 | [diff] [blame] | 52 | repetition'``: | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 53 |  | 
|  | 54 | >>> import hashlib | 
|  | 55 | >>> m = hashlib.md5() | 
|  | 56 | >>> m.update("Nobody inspects") | 
|  | 57 | >>> m.update(" the spammish repetition") | 
|  | 58 | >>> m.digest() | 
|  | 59 | '\xbbd\x9c\x83\xdd\x1e\xa5\xc9\xd9\xde\xc9\xa1\x8d\xf0\xff\xe9' | 
| Gregory P. Smith | e1ac4f1 | 2007-11-06 00:19:03 +0000 | [diff] [blame] | 60 | >>> m.digest_size | 
|  | 61 | 16 | 
|  | 62 | >>> m.block_size | 
|  | 63 | 64 | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 64 |  | 
| Georg Brandl | e8f1b00 | 2008-03-22 22:04:10 +0000 | [diff] [blame] | 65 | More condensed: | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 66 |  | 
|  | 67 | >>> hashlib.sha224("Nobody inspects the spammish repetition").hexdigest() | 
|  | 68 | 'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2' | 
|  | 69 |  | 
|  | 70 | A generic :func:`new` constructor that takes the string name of the desired | 
|  | 71 | algorithm as its first parameter also exists to allow access to the above listed | 
|  | 72 | hashes as well as any other algorithms that your OpenSSL library may offer.  The | 
|  | 73 | named constructors are much faster than :func:`new` and should be preferred. | 
|  | 74 |  | 
| Georg Brandl | e8f1b00 | 2008-03-22 22:04:10 +0000 | [diff] [blame] | 75 | Using :func:`new` with an algorithm provided by OpenSSL: | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 76 |  | 
|  | 77 | >>> h = hashlib.new('ripemd160') | 
|  | 78 | >>> h.update("Nobody inspects the spammish repetition") | 
|  | 79 | >>> h.hexdigest() | 
|  | 80 | 'cc4a5ce1b3df48aec5d22d1f16b894a0b894eccc' | 
|  | 81 |  | 
| Gregory P. Smith | e6390a1 | 2010-03-01 02:01:47 +0000 | [diff] [blame] | 82 | This module provides the following constant attribute: | 
|  | 83 |  | 
|  | 84 | .. data:: hashlib.algorithms | 
|  | 85 |  | 
|  | 86 | A tuple providing the names of the hash algorithms guaranteed to be | 
|  | 87 | supported by this module. | 
|  | 88 |  | 
|  | 89 | .. versionadded:: 2.7 | 
|  | 90 |  | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 91 | The following values are provided as constant attributes of the hash objects | 
|  | 92 | returned by the constructors: | 
|  | 93 |  | 
|  | 94 |  | 
| Georg Brandl | 58d23fb | 2009-09-14 14:50:47 +0000 | [diff] [blame] | 95 | .. data:: hash.digest_size | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 96 |  | 
| Gregory P. Smith | e1ac4f1 | 2007-11-06 00:19:03 +0000 | [diff] [blame] | 97 | The size of the resulting hash in bytes. | 
|  | 98 |  | 
| Georg Brandl | 58d23fb | 2009-09-14 14:50:47 +0000 | [diff] [blame] | 99 | .. data:: hash.block_size | 
| Gregory P. Smith | e1ac4f1 | 2007-11-06 00:19:03 +0000 | [diff] [blame] | 100 |  | 
|  | 101 | The internal block size of the hash algorithm in bytes. | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 102 |  | 
|  | 103 | A hash object has the following methods: | 
|  | 104 |  | 
|  | 105 |  | 
|  | 106 | .. method:: hash.update(arg) | 
|  | 107 |  | 
|  | 108 | Update the hash object with the string *arg*.  Repeated calls are equivalent to | 
|  | 109 | a single call with the concatenation of all the arguments: ``m.update(a); | 
|  | 110 | m.update(b)`` is equivalent to ``m.update(a+b)``. | 
|  | 111 |  | 
| Gregory P. Smith | d02eeda | 2009-05-04 00:16:49 +0000 | [diff] [blame] | 112 | .. versionchanged:: 2.7 | 
|  | 113 |  | 
|  | 114 | The Python GIL is released to allow other threads to run while | 
|  | 115 | hash updates on data larger than 2048 bytes is taking place when | 
|  | 116 | using hash algorithms supplied by OpenSSL. | 
|  | 117 |  | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 118 |  | 
|  | 119 | .. method:: hash.digest() | 
|  | 120 |  | 
|  | 121 | Return the digest of the strings passed to the :meth:`update` method so far. | 
|  | 122 | This is a string of :attr:`digest_size` bytes which may contain non-ASCII | 
|  | 123 | characters, including null bytes. | 
|  | 124 |  | 
|  | 125 |  | 
|  | 126 | .. method:: hash.hexdigest() | 
|  | 127 |  | 
|  | 128 | Like :meth:`digest` except the digest is returned as a string of double length, | 
|  | 129 | containing only hexadecimal digits.  This may  be used to exchange the value | 
|  | 130 | safely in email or other non-binary environments. | 
|  | 131 |  | 
|  | 132 |  | 
|  | 133 | .. method:: hash.copy() | 
|  | 134 |  | 
|  | 135 | Return a copy ("clone") of the hash object.  This can be used to efficiently | 
|  | 136 | compute the digests of strings that share a common initial substring. | 
|  | 137 |  | 
|  | 138 |  | 
|  | 139 | .. seealso:: | 
|  | 140 |  | 
|  | 141 | Module :mod:`hmac` | 
|  | 142 | A module to generate message authentication codes using hashes. | 
|  | 143 |  | 
|  | 144 | Module :mod:`base64` | 
|  | 145 | Another way to encode binary hashes for non-binary environments. | 
|  | 146 |  | 
|  | 147 | http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf | 
|  | 148 | The FIPS 180-2 publication on Secure Hash Algorithms. | 
|  | 149 |  | 
| Georg Brandl | 16fd5cd | 2010-05-21 20:24:45 +0000 | [diff] [blame] | 150 | http://en.wikipedia.org/wiki/Cryptographic_hash_function#Cryptographic_hash_algorithms | 
|  | 151 | Wikipedia article with information on which algorithms have known issues and | 
| Georg Brandl | 8ec7f65 | 2007-08-15 14:28:01 +0000 | [diff] [blame] | 152 | what that means regarding their use. | 
|  | 153 |  |