AC2 TOC - Number-Theoretic Algorithms and Hardness Assumptions¶
- Generating Random Group Elements and Generators
- Generating (Random) Primes
- Algorithm of Euclid
- Multiplicative Inverse
- Modular Exponentiation
- Computational Hardness Assumption
- FACTORING & DL Algorithms
- Complexity Notation
- Complexity Classes
- Complexity Reduction
Exercises