-
Request
a trial -
Request
a demo -
Request
a quote
-
Request
a trial -
Request
a demo -
Request
a quote
API Reference
This reference is inactive and cannot be clicked.
CLR Reference
This reference is inactive and cannot be clicked.
Cryptographic Hash Function Pseudonymization
Purpose
The Cryptographic Hash Function Pseudonymization component pseudonymizes any string data by computing its hash using MD5, SHA-1, SHA-256, or SHA-512. It incorporates a unique seed tied to the hardware device where the components are installed, ensuring consistency and security.
The output is generated using the following formula:
output = hash (input + seed)
Algorithm
We use the following algorithms:
-
MD5: This algorithm processes 512-bit blocks in 64 rounds of nonlinear operations, producing a 128-bit hash. Its advantage is high speed, but its drawback is vulnerability to collision attacks which might compromize security.
-
SHA-1: It processes 512-bit blocks in 80 rounds of transformations, generating a 160-bit hash. While it offers greater security than MD5, NIST does not recommend its use for security-sensitive applications due to its vulnerability to collision attacks and chosen-prefix attacks.
Use SHA-1 only in non-security-critical scenarios, such as legacy systems or checksum verification. For secure applications, consider using SHA-256 or SHA-512 instead. -
SHA-256: It processes 512-bit blocks in 64 rounds, generating a 256-bit hash with strong cryptographic security. Its advantages include high reliability and strong resistance to collisions, while its drawback is a higher computational load compared to MD5 and SHA-1.
-
SHA-512: Like SHA-256, it operates on 1024-bit blocks in 80 rounds, generating a 512-bit hash. Its advantages include enhanced security and optimization for 64-bit systems, while its drawback is the larger hash size, which may be excessive for some applications.
Go to Tutorial
Data Masking Components: Cryptographic Hash Function
Download Manual
