Useful Links
Computer Science
Cybersecurity
Cryptography
1. Foundations of Cryptography
2. Mathematical Foundations
3. Symmetric Key Cryptography
4. Asymmetric Key Cryptography
5. Cryptographic Hash Functions
6. Message Authentication and Integrity
7. Key Management and Distribution
8. Cryptanalysis and Security Analysis
9. Applied Cryptography and Security Protocols
10. Advanced Cryptographic Concepts
11. Cryptographic Standards and Compliance
Mathematical Foundations
Number Theory Basics
Prime Numbers
Definition and Properties
Prime Factorization
Primality Testing
Prime Generation
Modular Arithmetic
Congruence Relations
Modular Addition and Multiplication
Modular Inverses
Extended Euclidean Algorithm
Greatest Common Divisor
Euclidean Algorithm
Bézout's Identity
Chinese Remainder Theorem
Statement and Applications
Constructive Proof
Euler's Theorem
Euler's Totient Function
Applications in Cryptography
Fermat's Little Theorem
Statement and Proof
Cryptographic Applications
Group Theory
Groups
Definition and Properties
Cyclic Groups
Group Orders
Finite Fields
Field Properties
Galois Fields
Polynomial Arithmetic
Discrete Logarithm Problem
Computational Difficulty
Elliptic Curve Mathematics
Elliptic Curve Definition
Point Addition
Scalar Multiplication
Elliptic Curve Groups
Elliptic Curve Discrete Logarithm Problem
Probability and Information Theory
Basic Probability
Random Variables
Entropy
Perfect Secrecy
Computational Indistinguishability
Previous
1. Foundations of Cryptography
Go to top
Next
3. Symmetric Key Cryptography