The document contains solutions to 5 problems related to computer and network security concepts: 1. It finds the greatest common divisor (GCD) of several pairs of numbers using Euclid's algorithm. 2. It calculates several numbers modulo other numbers. 3. It uses Fermat's theorem to calculate 3201 modulo 11. 4. It performs encryption and decryption of messages using the RSA algorithm with sample public and private keys. 5. Given a cipher text and public key, it decrypts the plain text message using the RSA algorithm.