A Study on Fingerprint Hash Code Generation Using Euclidean Distance for Identifying a User

Main Article Content

Krishna Prasad K.
Aithal P. S.


Biometrics innovation has ended up being a precise and proficient response to the security issue. Biometrics is a developing field of research as of late and has been dedicated to the distinguishing proof or authentication of people utilizing one or multiple inherent physical or behavioural characteristics. The unique fingerprint traits of a man are exceptionally exact and are special to a person. Authentication frameworks in light of unique fingerprints have demonstrated to create low false acceptance rate and false rejection rate, alongside other favourable circumstances like simple and easy usage strategy. But the modern study reveals that fingerprint is not so secured like secured passwords which consist of alphanumeric characters, number and special characters. Fingerprints are left at crime places, on materials or at the door which is usually class of latent fingerprints. We cannot keep fingerprint as secure like rigid passwords. In this paper, we discuss fingerprint image Hash code generation based on the Euclidean distance calculated on the binary image. Euclidean distance on a binary image is the distance from every pixel to the nearest neighbour pixel which is having bit value one. Hashcode alone not sufficient for Verification or Authentication purpose, but can work along with Multifactor security model or it is half secured. To implement Hash code generation we use MATLAB2015a. This study shows how fingerprints Hash code uniquely identifies a user or acts as index-key or identity-key


Download data is not yet available.

Article Details

How to Cite
Krishna Prasad K., & Aithal P. S. (2017). A Study on Fingerprint Hash Code Generation Using Euclidean Distance for Identifying a User. International Journal of Management, Technology and Social Sciences (IJMTS), 2(2), 116–126. https://doi.org/10.47992/IJMTS.2581.6012.0030

Most read articles by the same author(s)

1 2 3 4 5 6 7 8 9 10 > >>