Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 1 | """HMAC (Keyed-Hashing for Message Authentication) Python module. |
| 2 | |
| 3 | Implements the HMAC algorithm as described by RFC 2104. |
| 4 | """ |
| 5 | |
Gregory P. Smith | e1ac4f1 | 2007-11-06 00:19:03 +0000 | [diff] [blame] | 6 | import warnings as _warnings |
| 7 | |
Andrew M. Kuchling | 8fe2d20 | 2006-12-19 14:13:05 +0000 | [diff] [blame] | 8 | trans_5C = "".join ([chr (x ^ 0x5C) for x in xrange(256)]) |
| 9 | trans_36 = "".join ([chr (x ^ 0x36) for x in xrange(256)]) |
Tim Peters | b64bec3 | 2001-09-18 02:26:39 +0000 | [diff] [blame] | 10 | |
Andrew M. Kuchling | 1ccdff9 | 2001-11-02 21:49:20 +0000 | [diff] [blame] | 11 | # The size of the digests returned by HMAC depends on the underlying |
Andrew M. Kuchling | a7ebb33 | 2006-12-27 03:25:31 +0000 | [diff] [blame] | 12 | # hashing module used. Use digest_size from the instance of HMAC instead. |
Andrew M. Kuchling | 1ccdff9 | 2001-11-02 21:49:20 +0000 | [diff] [blame] | 13 | digest_size = None |
| 14 | |
Tim Peters | 934d31b | 2004-03-20 20:11:29 +0000 | [diff] [blame] | 15 | # A unique object passed by HMAC.copy() to the HMAC constructor, in order |
| 16 | # that the latter return very quickly. HMAC("") in contrast is quite |
| 17 | # expensive. |
| 18 | _secret_backdoor_key = [] |
| 19 | |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 20 | class HMAC: |
Gregory P. Smith | e1ac4f1 | 2007-11-06 00:19:03 +0000 | [diff] [blame] | 21 | """RFC 2104 HMAC class. Also complies with RFC 4231. |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 22 | |
Andrew M. Kuchling | 1ccdff9 | 2001-11-02 21:49:20 +0000 | [diff] [blame] | 23 | This supports the API for Cryptographic Hash Functions (PEP 247). |
Tim Peters | b64bec3 | 2001-09-18 02:26:39 +0000 | [diff] [blame] | 24 | """ |
Andrew M. Kuchling | a7ebb33 | 2006-12-27 03:25:31 +0000 | [diff] [blame] | 25 | blocksize = 64 # 512-bit HMAC; can be changed in subclasses. |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 26 | |
| 27 | def __init__(self, key, msg = None, digestmod = None): |
| 28 | """Create a new HMAC object. |
| 29 | |
| 30 | key: key for the keyed hash object. |
| 31 | msg: Initial input for the hash, if provided. |
Gregory P. Smith | f21a5f7 | 2005-08-21 18:45:59 +0000 | [diff] [blame] | 32 | digestmod: A module supporting PEP 247. *OR* |
| 33 | A hashlib constructor returning a new hash object. |
| 34 | Defaults to hashlib.md5. |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 35 | """ |
Tim Peters | 934d31b | 2004-03-20 20:11:29 +0000 | [diff] [blame] | 36 | |
| 37 | if key is _secret_backdoor_key: # cheap |
| 38 | return |
| 39 | |
Raymond Hettinger | 7fdfc2d | 2002-05-31 17:49:10 +0000 | [diff] [blame] | 40 | if digestmod is None: |
Gregory P. Smith | f21a5f7 | 2005-08-21 18:45:59 +0000 | [diff] [blame] | 41 | import hashlib |
| 42 | digestmod = hashlib.md5 |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 43 | |
Gregory P. Smith | f21a5f7 | 2005-08-21 18:45:59 +0000 | [diff] [blame] | 44 | if callable(digestmod): |
| 45 | self.digest_cons = digestmod |
| 46 | else: |
| 47 | self.digest_cons = lambda d='': digestmod.new(d) |
| 48 | |
| 49 | self.outer = self.digest_cons() |
| 50 | self.inner = self.digest_cons() |
| 51 | self.digest_size = self.inner.digest_size |
Tim Peters | 8876848 | 2001-11-13 21:51:26 +0000 | [diff] [blame] | 52 | |
Gregory P. Smith | e1ac4f1 | 2007-11-06 00:19:03 +0000 | [diff] [blame] | 53 | if hasattr(self.inner, 'block_size'): |
| 54 | blocksize = self.inner.block_size |
| 55 | if blocksize < 16: |
| 56 | # Very low blocksize, most likely a legacy value like |
| 57 | # Lib/sha.py and Lib/md5.py have. |
| 58 | _warnings.warn('block_size of %d seems too small; using our ' |
| 59 | 'default of %d.' % (blocksize, self.blocksize), |
| 60 | RuntimeWarning, 2) |
| 61 | blocksize = self.blocksize |
| 62 | else: |
| 63 | _warnings.warn('No block_size attribute on given digest object; ' |
| 64 | 'Assuming %d.' % (self.blocksize), |
| 65 | RuntimeWarning, 2) |
| 66 | blocksize = self.blocksize |
| 67 | |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 68 | if len(key) > blocksize: |
Gregory P. Smith | f21a5f7 | 2005-08-21 18:45:59 +0000 | [diff] [blame] | 69 | key = self.digest_cons(key).digest() |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 70 | |
| 71 | key = key + chr(0) * (blocksize - len(key)) |
Andrew M. Kuchling | 8fe2d20 | 2006-12-19 14:13:05 +0000 | [diff] [blame] | 72 | self.outer.update(key.translate(trans_5C)) |
| 73 | self.inner.update(key.translate(trans_36)) |
Raymond Hettinger | 094662a | 2002-06-01 01:29:16 +0000 | [diff] [blame] | 74 | if msg is not None: |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 75 | self.update(msg) |
| 76 | |
| 77 | ## def clear(self): |
| 78 | ## raise NotImplementedError, "clear() method not available in HMAC." |
| 79 | |
| 80 | def update(self, msg): |
| 81 | """Update this hashing object with the string msg. |
| 82 | """ |
| 83 | self.inner.update(msg) |
| 84 | |
| 85 | def copy(self): |
| 86 | """Return a separate copy of this hashing object. |
| 87 | |
| 88 | An update to this copy won't affect the original object. |
| 89 | """ |
Andrew M. Kuchling | a7ebb33 | 2006-12-27 03:25:31 +0000 | [diff] [blame] | 90 | other = self.__class__(_secret_backdoor_key) |
Gregory P. Smith | f21a5f7 | 2005-08-21 18:45:59 +0000 | [diff] [blame] | 91 | other.digest_cons = self.digest_cons |
Tim Peters | 934d31b | 2004-03-20 20:11:29 +0000 | [diff] [blame] | 92 | other.digest_size = self.digest_size |
Andrew M. Kuchling | 1ccdff9 | 2001-11-02 21:49:20 +0000 | [diff] [blame] | 93 | other.inner = self.inner.copy() |
| 94 | other.outer = self.outer.copy() |
| 95 | return other |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 96 | |
Andrew M. Kuchling | 7166232 | 2006-12-27 03:31:24 +0000 | [diff] [blame] | 97 | def _current(self): |
| 98 | """Return a hash object for the current state. |
| 99 | |
| 100 | To be used only internally with digest() and hexdigest(). |
| 101 | """ |
| 102 | h = self.outer.copy() |
| 103 | h.update(self.inner.digest()) |
| 104 | return h |
| 105 | |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 106 | def digest(self): |
| 107 | """Return the hash value of this hashing object. |
| 108 | |
| 109 | This returns a string containing 8-bit data. The object is |
| 110 | not altered in any way by this function; you can continue |
| 111 | updating the object after calling this function. |
| 112 | """ |
Andrew M. Kuchling | 7166232 | 2006-12-27 03:31:24 +0000 | [diff] [blame] | 113 | h = self._current() |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 114 | return h.digest() |
| 115 | |
| 116 | def hexdigest(self): |
| 117 | """Like digest(), but returns a string of hexadecimal digits instead. |
| 118 | """ |
Andrew M. Kuchling | 7166232 | 2006-12-27 03:31:24 +0000 | [diff] [blame] | 119 | h = self._current() |
| 120 | return h.hexdigest() |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 121 | |
| 122 | def new(key, msg = None, digestmod = None): |
| 123 | """Create a new hashing object and return it. |
| 124 | |
| 125 | key: The starting key for the hash. |
| 126 | msg: if available, will immediately be hashed into the object's starting |
Tim Peters | b64bec3 | 2001-09-18 02:26:39 +0000 | [diff] [blame] | 127 | state. |
Guido van Rossum | 8ceef41 | 2001-09-11 15:54:00 +0000 | [diff] [blame] | 128 | |
| 129 | You can now feed arbitrary strings into the object using its update() |
| 130 | method, and can ask for the hash value at any time by calling its digest() |
| 131 | method. |
| 132 | """ |
| 133 | return HMAC(key, msg, digestmod) |