From 047a69ba011e2ae9cf120305ba475c7b53fa9d18 Mon Sep 17 00:00:00 2001 From: nadams Date: Wed, 17 May 2017 09:00:28 -0700 Subject: [PATCH] Edited ch04.asciidoc with Atlas code editor --- ch04.asciidoc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/ch04.asciidoc b/ch04.asciidoc index ed73a4b9..108d2fbc 100644 --- a/ch04.asciidoc +++ b/ch04.asciidoc @@ -142,7 +142,7 @@ or \end{equation} ++++ -The _mod p_ (modulo prime number p) indicates that this curve is over a finite field of prime order _p_, also written as **F**~__p__~, where p = 2^256^ – 2^32^ – 2^9^ – 2^8^ – 2^7^ – 2^6^ – 2^4^ – 1, a very large prime number. +The _mod p_ (modulo prime number p) indicates that this curve is over a finite field of prime order _p_, also written as latexmath:[\( \mathbb{F}_p \)], where p = 2^256^ – 2^32^ – 2^9^ – 2^8^ – 2^7^ – 2^6^ – 2^4^ – 1, a very large prime number. Because this curve is defined over a finite field of prime order instead of over the real numbers, it looks like a pattern of dots scattered in two dimensions, which makes it difficult to visualize. However, the math is identical to that of an elliptic curve over real numbers. As an example, <> shows the same elliptic curve over a much smaller finite field of prime order 17, showing a pattern of dots on a grid. The +secp256k1+ bitcoin elliptic curve can be thought of as a much more complex pattern of dots on a unfathomably large grid.