By completing this course, students will be able to (1) construct hyperelliptic curves (HEC) of genus ≥2 with cryptographic parameters, (2) implement divisor arithmetic using Cantor’s algorithm, (3) compare HEC vs. ECC security/efficiency tradeoffs, and (4) design HEC-based protocols (e.g., signatures) with complexity analysis.