This course introduces the theory and applications of hyperelliptic curves in cryptography, covering their construction, Jacobian varieties, and group law. Students will analyze algorithmic aspects (e.g., Cantor’s algorithm for divisor arithmetic), compare security tradeoffs to elliptic curves, and implement cryptographic protocols (e.g., HECC-based signatures) with complexity evaluations.