A lot of public-key cryptography is based on finite fields, and the integers modulo N combined with addition and multiplication form a finite field iff N is prime. This brings some extremely useful properties e.g. every non-zero element has a multiplicative inverse. N must also be public so people can compute things (e.g. to verify a signature), and big to resist brute force attacks.