Cryptography & Network Security – Unit II: Number Theory & Public Key CryptographyFree

Complete Cryptography & Network Security – Unit II notes covering Number Theory and Public Key Cryptography. The material includes the Euclidean Algorithm, Greatest Common Divisor (GCD), Modular Arithmetic, Extended Euclidean Algorithm, Fermat’s Theorem, Euler’s Theorem, Euler’s Totient Function, Chinese Remainder Theorem (CRT), and Discrete Logarithms.

The unit also covers Public Key Cryptography principles, asymmetric encryption, public and private keys, encryption and decryption, digital signatures, key exchange, RSA Algorithm, Diffie-Hellman Key Exchange, and Elliptic Curve Cryptography. The notes include algorithms, examples, mathematical calculations, diagrams, and step-by-step explanations.