scispace - formally typeset
Search or ask a question
Author

S. Subashanthini

Bio: S. Subashanthini is an academic researcher from VIT University. The author has contributed to research in topics: Bitwise operation & Encryption. The author has an hindex of 1, co-authored 1 publications receiving 1 citations.

Papers
More filters
Book ChapterDOI
06 Dec 2018
TL;DR: A modified line map algorithm is proposed and it is considered as a chaotic map to scramble the image and its robustness against attacks has been increased by repeated permutation-diffusion round for ‘n’ number of times.
Abstract: In this digital era, all the information takes the form of various media during communication. This leads to the need for more concern on the security measures so that the data being transmitted is resilient to various malicious attacks. In this paper, a modified line map algorithm is proposed and it is considered as a chaotic map to scramble the image. The resultant chaotic Line map has been employed to permute the image pixels, whereas diffusion is performed by XOR operation to completely encrypt the image. The robustness of the image against attacks has been increased by repeated permutation-diffusion round for ‘n’ number of times. Histogram analysis, Number of pixels change rate and correlation analysis has been performed to analyze the robustness of the proposed technique. Simulation results proves that this methodology can be implemented in real time applications.

1 citations


Cited by
More filters
DOI
Apri Siswanto1
26 Apr 2020
TL;DR: A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed.
Abstract: Fingerprint is a reliable user authentication method as it is unique to individual users that makes it efficient for authenticating users. In a fingerprint authentication system, user fingerprint information is stored in databases in an image format known as a fingerprint template. Although fingerprint is reliable, the templates stored in the database are exposed to security threats either during the data transmission process over the network or in storage. Therefore, there is a need to protect the fingerprint template, especially in unsecured networks to maintain data privacy and confidentiality. Many past studies proposed fingerprint template protection (FTP) using chaotic-based encryption algorithms that are more suitable to secure images than conventional encryption such as DES, AES, and RSA. The chaotic-based encryption algorithms have been improved a lot in terms of their robustness. However, the robustness of the algorithm caused a trade-off to encryption speed where it remains an issue in FTP. Hence, this study aims to improve the limitations found in the existing chaotic-based encryption algorithms for FTP by improving its encryption speed using Henon and Logistic map. A series of simulations were conducted using MATLAB to evaluate the performance of the proposed chaotic-based encryption algorithm for FTP through different analyses covering key sensitivity, histogram, correlations, differential, information entropy, and encryption/decryption speed. The performance proposed encryption algorithm was promising which could be a starting point for detailed analysis and implementation in real application domains.

3 citations