Fingerprint representation and matching for secure smartcard authentication

In this paper, a lightweight fingerprint-matching algorithm (4 kB) is proposed. This algorithm is based on matching features that are invariant to major transformations like translation and rotation. The algorithm can be executed on devices with low computing power and limited memory size. Thus, the matching algorithm is implemented on smartcard over the Java CardTM platform. The algorithm has an asymmetric terminating behaviour. Therefore, the execution time varies depending on correct positive matches (similar fingerprint) and correct negative matches (dissimilar fingerprint). In this paper, two fingerprint authentication methods are implemented. The first fingerprint authentication method is applied using one reference and one candidate fingerprints. However, the second method is performed by the aid of a fusion-based fingerprint authentication manner using two reference and one candidate fingerprints. The performance of the methods in terms of authentication accuracy is tested on some standard databases from the Fingerprint Verification Competition 2002 (FVC2002).