Data obfuscation - Required details related to HashLOV and how secure is the methodology
search cancel

Data obfuscation - Required details related to HashLOV and how secure is the methodology

book

Article ID: 190882

calendar_today

Updated On:

Products

CA Test Data Manager (Data Finder / Grid Tools)

Issue/Introduction

Hi Team,

The Company's Data obfuscation team need below details.

1) Our privacy team requested to verify, how secure is HASHLOV method? Can someone reverse the obfuscated data after using this method. 
2) What is technology used in HASHLOV?

Apart from these two queries, we need to obfuscate account number in consistent format across files. What is the best methodology to use and how secure will it be?
Do we have any seed data for account numbers?

Did you implement account number obfuscation to any of your client?

Environment

Release : 4.5

Component : TDM

Resolution

Formatencrypt is based on Vignere ciper

The Vigenère cipher is a method of encrypting alphabetic text by using a series of interwoven Caesar ciphers, based on the letters of a keyword. It employs a form of polyalphabetic substitution


Hashlov is based on hashcode to get a value to pick an item from the seedlist.

Simply put, hashCode() returns an integer value, generated by a hashing algorithm.

Objects that are equal (according to their equals()) must return the same hash code. It's not required for different objects to return different hash codes.

The general contract of hashCode() states:

Whenever it is invoked on the same object more than once during an execution of a Java application, hashCode() must consistently return the same value, provided no information used in equals comparisons on the object is modified. This value needs not remain consistent from one execution of an application to another execution of the same application

If two objects are equal according to the equals(Object) method, then calling the hashCode() method on each of the two objects must produce the same value

It is not required that if two objects are unequal according to the equals(java.lang.Object) method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, developers should be aware that producing distinct integer results for unequal objects improves the performance of hash tables