All PDFs

Hashing FAQs and Examples

Issue link:

Contents of this Issue


Page 0 of 2

Last modified: 10/28/2019 Hashing FAQs & Examples What are hashing algorithms? Hashing algorithms are functions that take a text input and return a hash code or message fingerprint of that input. The resulting hash code is a fixed length and will vary widely with small variations in input. Why are hashing algorithms used? One of the primary features of hashing algorithms is that they are one-way functions which means that it is nearly impossible to determine the original input based only on the hash code. Hashing algorithms power the security behind internet banking and allow Jornaya to receive data in a way that protects consumer privacy. What algorithms are compatible with Jornaya Activate? MD5 and SHA-256 are two popular algorithms that Jornaya Activate supports. Many databases and programming languages have built-in functions that will hash database content for you. • MD5 algorithm always produces 32-character strings • SHA-256 algorithm always produces 64-character strings
 If the hashed fields being sent to Jornaya are not 32 or 64 characters, please check that you are using one of the supported hashing algorithms. How are hashing and encryption different? Encryption turns data into a series of unreadable characters that aren't of a fixed length. The key difference between encryption and hashing is that encrypted strings can be reversed back into their original decrypted form if you have the right key. Hash Tips and Examples When hashing values, keep in mind: • Upper and lower case values produce different hash values (use lower case for Jornaya Activate) • Leading/trailing white spaces will modify the hash values (please strip these out for Jornaya Activate) • All characters impact the hash (please be sure to strip out parentheses, hyphens, and/ or periods from phone numbers submitted to Jornaya Activate)
 © Jornaya. All rights reserved. Confidential and Proprietary. For information purposes only. Hashing FAQs & Examples

Articles in this issue

view archives of All PDFs - Hashing FAQs and Examples