In 1900 Hilbert presented his now famous list of 23 open problems. The tenth problem in its original form was to find an algorithm to decide, given a multivariate polynomial equation with integer coefficients, whether it has a solution over the integers. Hilbert's Tenth Problem remained open until 1970 when Matiyasevich, building on work by Davis, Putnam and Robinson, proved that no such algorithm exists, i.e. Hilbert's Tenth Problem is undecidable. Since then, analogues of this problem have been studied by asking the same question for polynomial equations with coefficients and solutions in other commutative rings. In this talk we will discuss how elliptic curves can be used to prove the undecidability of Hilbert's Tenth Problem for various rings and fields.