Abstract: Fingerprint matching algorithm is a key issue of the fingerprint recognition, there already exist many study about fingerprint matching algorithms. According to dependence on core point, fingerprint matching algorithms can he grouped into two categories: core-based match algorithms and structure-based match algorithms. Most of the structure-based matching algorithms are time consuming, therefore they are not suitable for on-line application. Meanwhile, core-based matching algorithm is more efficient than the structure-based matching algorithm, but: it highly depends on core point detection precision. In this paper, we present a new core-based structure matching algorithm which both considers efficient and precision. Firstly, we use core point detection algorithm to find the core point and define some local minutiae structures around core point. Through matching these local minutiae structures, we can get some corresponding points of the two fingerprint images. Secondly, we use the corresponding points to match the global feature of fingerprints, where a match table is constructed to prevent one to many false minutiae match. Finally, we promote the global match distance and global match distance variance to help make the final decision. Experimental result shows that the performance of the proposed algorithm is good.