# ECDSA Prerequisites

This course introduces the **mathematical foundations** needed to understand the **Elliptic Curve Digital Signature Algorithm (ECDSA)**.

You will explore:

* **Modular arithmetic** and how numbers “wrap around”
* **Groups, rings, and finite fields** as the building blocks of abstract algebra
* The **Discrete Logarithm Problem (DLP)** and why it is hard to solve
* The **Elliptic Curve DLP (ECDLP)** and its role in cryptography
* **Elliptic Curve Cryptography (ECC)** basics: point addition, point doubling, and scalar multiplication

By the end of the course, learners will:

* Understand the **concepts that make ECDSA secure**
* Be familiar with the **structure and properties of elliptic curves**
* Build confidence in tackling the **ECDSA algorithm** itself

This course is designed for **beginners in cryptography**. No advanced math background is required — just curiosity and an interest in how cryptography works.

**Note:** This chapter introduces some mathematical concepts that may feel abstract at first. You don’t need to retain every detail — the goal is to provide a complete resource for those who want to explore deeper. Read through it at your own pace; there is **no rigorous assessment** for this material.