Skip to main content
All CollectionsPlugins
Cryptographic Hashes
Cryptographic Hashes

Understand how to use our cryptographic hash plugin

Adam avatar
Written by Adam
Updated over 7 months ago

Cryptographic hash functions are essential for various purposes, including verifying data integrity, creating digital signatures, and generating random numbers. This plugin allows users to verify the integrity of their API connections by generating Hash-based Message Authentication Codes (HMACs). An HMAC is a message authentication code that uses a cryptographic hash function (such as SHA-1) combined with a secret key. The secret key pads the message and is then combined with the message digest, resulting in a message that can be verified as authentic by anyone who has the secret key.
​
Supported Hash Functions

We currently support the following types of hash function verification:

  • SHA256: A cryptographic hash function that produces a hash value up to 256 bits long, used in many different applications.

  • HMAC SHA1: Can produce a hash value up to 160 bits long.

  • SHA512: A cryptographic hash function that produces a hash value up to 512 bits long.

  • MD5: A widely used hash function that produces a 128-bit hash value.

  • SHA1: Can produce a hash value up to 160 bits long.

Getting Started

  1. Install the Plugin:

    • Go to the Plugins tab.

    • Search for "Cryptographic Hashes" and click Install.

  2. Add an Element to Your Page:

    • For example, use a button to trigger a workflow.

  3. Configure the Plugin:

    • Within the Plugins tab, access the available functions (ensure to input your hash key within the function):

      • SHA256

      • HMAC SHA1

      • SHA512

      • MD5

      • SHA1

  4. Display Results:

    • Choose to display either the signature or error message of the cryptographic hash in your chosen element.

  5. Input the Secure Key:

    • Navigate to the Plugins tab and input the Secure Key. Remember to keep this key secure.

The plugin is now configured and ready to use!
​
​
​

Did this answer your question?