From 13f406acc13a0578710756f8a2e2160cd0430144 Mon Sep 17 00:00:00 2001 From: Daira Hopwood Date: Sat, 30 Jan 2021 03:24:35 +0000 Subject: [PATCH] Fix link --- book/src/background/curves.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/book/src/background/curves.md b/book/src/background/curves.md index 3412a8e..4e55dde 100644 --- a/book/src/background/curves.md +++ b/book/src/background/curves.md @@ -3,7 +3,7 @@ Elliptic curves constructed over finite fields are another important cryptographic tool. We use elliptic curves because they provide a cryptographic [group](fields.md#Groups), -i.e. a group in which the [discrete logarithm problem](fields#) is hard. +i.e. a group in which the discrete logarithm problem (discussed below) is hard. There are several ways to define the curve equation, but for our purposes, let $\mathbb{F}_p$ be a large (255-bit) field, and then let the set of solutions $(x, y)$ to