1) The document discusses cryptographic techniques such as public key cryptography using prime numbers and the RSA and ElGamal algorithms. It also covers hash functions and the SHA-512 algorithm.
2) Examples are provided of generating public/private key pairs for RSA using prime numbers and extended Euclidian algorithms. The encryption and decryption processes for RSA and ElGamal are also summarized.
3) The basics of hash functions and the components used in SHA-512 like bitwise logic operations and modular addition are defined at a high level. Padding techniques for hash functions to variable length messages are also covered briefly.