{'fraction_non_alphanumeric': 0.007326007326007326, 'fraction_numerical': 0.0, 'mean_word_length': 5.4674556213017755, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An efficient and lossless fingerprint encryption algorithm using Henon map & Arnold transformation

In this paper two stage biometric data protection scheme is being proposed using permutation and substitution mechanism of the chaotic theory which is lossless in nature. Arnold transformation and Henon map is used to design an efficient encryption system. The encryption method is aimed at generating an encrypted image that will have statistical properties completely dissimilar from the original image analysis which will make it difficult for any intruder to decrypt the image. The performance of the method has been experimentally analyzed using statistical analysis and correlation based methods. Correlation coefficient analysis is done to evaluate the behavior of pixels in horizontal and vertical directions and the results are found to be encouraging. This protection scheme provides the ability to encrypt the data and secure it from unauthorized users. Upon decryption the data is completely recovered making this scheme a lossless and efficient method of biometric data security.