I present the very basic concepts of modular arithmetic as they are needed in cryptography. Important topics are: congruences, Fermat's theorem and the Euler function.