Useful Links
Mathematics
Number Theory
1. Foundations of Number Theory
2. Divisibility Theory
3. Prime Numbers and Factorization
4. Greatest Common Divisor and Least Common Multiple
5. Modular Arithmetic and Congruences
6. Classical Theorems in Number Theory
7. Arithmetic Functions
8. Diophantine Equations
9. Quadratic Residues and Reciprocity
10. Prime Number Theory
11. Continued Fractions
12. Elementary Analytic Number Theory
13. Cryptographic Applications
14. Advanced Topics and Connections
Cryptographic Applications
Classical Cryptography
Caesar Cipher
Affine Cipher
Hill Cipher
Cryptanalysis Methods
Modern Public Key Cryptography
Basic Principles
One-Way Functions
Trapdoor Functions
RSA Cryptosystem
Mathematical Foundation
Key Generation Algorithm
Encryption Process
Decryption Process
Security Analysis
Attacks and Countermeasures
Diffie-Hellman Key Exchange
Discrete Logarithm Problem
Protocol Description
Security Considerations
Variants and Extensions
Primality Testing
Deterministic Tests
Probabilistic Tests
Fermat Test
Miller-Rabin Test
Practical Considerations
Integer Factorization
Trial Division
Pollard's Rho Method
Quadratic Sieve
Elliptic Curve Method
Cryptographic Implications
Previous
12. Elementary Analytic Number Theory
Go to top
Next
14. Advanced Topics and Connections