HMAC is a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative cryptographic hash function, e.g., MD5, SHA-1, in combination with a secret shared key.
This module implements the HMAC algorithm. The basic idea is to generate a cryptographic hash of the actual data combined with a shared secret key. The resulting hash can then be used to check the transmitted or stored message to determine a level of trust, without transmitting the secret key.
hmac.new(key, msg=None, digestmod=None)
Return a new hmac object. key is a bytes or bytearray object giving the secret key. If msg is present, the method call update(msg) is made. digestmod is the digest name, digest constructor or module for the HMAC object to use. It supports any name suitable to hashlib.new().
A HMAC object has following methods:
- HMAC.update(msg): This method updates the hmac object with msg. 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).
- HMAC.digest(): This method returns the digest of the bytes passed to the update() method so far. This bytes object will be the same length as the digest_size of the digest given to the constructor.
- HMAC.hexdigest(): This method is like the digest() method except the digest is returned as a string twice the length containing only hexadecimal digits.
- HMAC.copy(): This method returns a copy or a clone of the hmac object. This can be used to efficiently compute the digests of strings that share a common initial substring.
A hash object has following attributes:
- HMAC.digest_size: The size of the resulting HMAC digest in bytes.
- HMAC.block_size: The internal block size of the hash algorithm in bytes.
- HMAC.name: The canonical name of this HMAC. e.g. hmac-sha1.
Hexdigest: df2ae7cdb5c849001e33ee29eb1c51ba2cafbaa7 Hexdigest after update: 3923273eb3aa9328478eb5aabf2d96e185256b4b Digest size: 20 bytes Block size: 64 bytes Canonical name: hmac-sha1 Digest: b"9#'>\xb3\xaa\x93(G\x8e\xb5\xaa\xbf-\x96\xe1\x85%kK" Hexdigest of clone: 3923273eb3aa9328478eb5aabf2d96e185256b4b
This article is contributed by Mayank Agrawal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Message Authentication Codes
- Challenge Response Authentication Mechanism (CRAM)
- 3D passwords-Advanced Authentication Systems
- Message Digest in Information security
- Schnorr Identification Scheme
- Encrypt using XOR Cipher with Repeating Key
- Cryptographic Hash Function in Java
- Additive Secret Sharing and Share Proactivization - Using Python
- Java implementation of Digital Signatures in Cryptography
- What is RC4 Encryption?
- Computer Security and its Challenges
- Difference between MANET and VANET
- How to generate Large Prime numbers for RSA Algorithm
- Asymmetric Encryption Cryptography in Java