Curves for Coding and Cryptography

In this elementary and introductory talk at INRIA‘s Junior Colloquium, we present the usual problems that occur in the theory of error-correcting codes and of cryptography. We show how the use of effective algebraic geometry over finite fields can help to solve some of the questions that arise in these disciplines.