Hashing Solutions

 

Next Steps
Overview Anonymize Custom Encode Encrypt Hash Pseudonymize Randomize Redact Scramble Twiddle Shift Tokenize
A diagram that shows hashing encryption

Hashing is a difficult-to-reverse data masking technique that converts a variable length "message" (e.g., someone's password) into an obfuscated, fixed-length, alphanumeric string. The message digest, or "hash value," can be an indexed look-up for the message. Sometimes there is more than one message per index (a "collision").

Because hashing is not as strong as encryption, or as reliably reversible, it is sometimes suitable for masking alone. More commonly, however, hashing is used with encryption. IRI supplies MD5, SHA1 and SHA2 hashing algorithms along with several encryption functions.

Hash functions are also used to generate checksums or Message Authentication Codes (MAC). These are created and sent along with messages like emails, EFTs, or passwords. When the message is received, its contents are run through the same hash function to create a new MAC. If the original and new MACs match, the message is authentic; if they do not, the message is likely to have been altered, and thus compromised.

Use the field-level hashing functions in the FieldShield, DarkShield or CellShield data masking tools in the IRI Data Protector suite, CoSort in the IRI Data Manager suite, or the IRI Voracity platform (which includes all of them) to help protect PII.

Or, create a MAC for one or more column values in each row. Include the MACs as an additional field or provide them in a separate file. Use the MAC to verify that the data in the record was undisturbed.

For more information and another use of hash values, see:

http://www.iri.com/blog/data-protection/hashing-tables-encryption/

1. What is data hashing and how does it work?
Hashing is a one-way data masking technique that converts any input (e.g., a password) into a fixed-length, alphanumeric string called a hash value or message digest. It is difficult to reverse and is used to protect or verify sensitive data.
2. How is hashing different from encryption?
Hashing is irreversible and used for verification, while encryption is reversible and designed to protect data that may need to be restored later. Encryption can be decrypted with the proper key, whereas hashes cannot be reliably reversed.
3. What are common use cases for hashing in data security?
Hashing is used to obfuscate passwords, verify data integrity, create message authentication codes (MACs), and generate checksums for file or data validation. It ensures that data has not been altered during storage or transmission.
4. Can I use hashing to mask personally identifiable information (PII)?
Yes. Hashing can be used to irreversibly mask PII values such as email addresses or user IDs when reversibility is not needed, such as for indexing, auditing, or privacy-compliant reporting.
5. How does hashing help ensure message authenticity?
Hashing functions can create a MAC (Message Authentication Code) that is transmitted alongside the original message. If the receiving system computes the same MAC, it confirms the message has not been tampered with.
6. What hashing algorithms are supported by IRI?
IRI supports MD5, SHA-1, and SHA-2 hashing algorithms, allowing users to choose the level of strength and compatibility needed for their security requirements.
7. Can IRI software create MACs for database records?
Yes. IRI FieldShield, DarkShield, CellShield, CoSort, and Voracity can generate MACs for one or more column values per row. The MAC can be stored alongside the data or in a separate file to verify data integrity later.
8. Is hashing secure enough on its own?
Hashing is suitable for one-way obfuscation and verification tasks, but for sensitive data that may need to be restored or decrypted, encryption is recommended. Hashing is most effective when combined with other security measures.
9. Can I use hashing with other data masking techniques in IRI?
Yes. Hashing can be used in combination with encryption, pseudonymization, redaction, and other masking functions within IRI's data masking tools to build layered protection strategies.
10. What are hash collisions and why do they matter?
A hash collision occurs when two different inputs produce the same hash value. While rare in strong algorithms like SHA-2, collisions can undermine integrity verification, which is why it's important to use reliable hashing standards.
Share this page

Request More Information

Live Chat

* indicates a required field.
IRI does NOT share your information.