Assess students' ability to evaluate the effectiveness, complexity, and reliability of AKS, Miller–Rabin, and elliptic-curve primality proving (ECPP) for large integers. Scope includes deterministic vs probabilistic guarantees, worst-case and expected time complexity, error probabilities and certificate verification, practical performance and resource trade-offs on large inputs, cryptographic suitability, and recommending tests for given scenarios.