In the past years many social network implementations have come to existence. There is not one network but many, and the user-base of these networks is different. Connecting the users of the separate networks is currently unsolved and seducing new users to existing systems becomes harder and harder as the users are not willing to join too many systems and build up their contact base from scratch each time. In this paper we propose a solution for the problem of finding existing contacts in a new system. An implementation of the described algorithm is also illustrated. Utilizing the algorithm in existing or new social networks can efficiently reduce the time needed for the users to find their friends in a newly joined network.