From b2f6e47eb7eb63d8b3d6432b4a94da003be71ccf Mon Sep 17 00:00:00 2001 From: "judymcconville@roadrunner.com" Date: Fri, 28 Apr 2017 10:26:30 -0700 Subject: [PATCH] Edited ch04.asciidoc with Atlas code editor --- ch04.asciidoc | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ch04.asciidoc b/ch04.asciidoc index ec8677f5..d06f726a 100644 --- a/ch04.asciidoc +++ b/ch04.asciidoc @@ -115,7 +115,7 @@ Elliptic curve multiplication is a type of function that cryptographers call a " [[elliptic_curve]] ==== Elliptic Curve Cryptography Explained -((("keys and addresses", "overview of", "elliptic curve cryptography")))((("elliptic curve cryptography", id="eliptic04")))Elliptic curve cryptography is a type of asymmetric or public-key cryptography based on the discrete logarithm problem as expressed by addition and multiplication on the points of an elliptic curve. +((("keys and addresses", "overview of", "elliptic curve cryptography")))((("elliptic curve cryptography", id="eliptic04")))((("cryptography", "elliptic curve cryptography", id="Celliptic04")))Elliptic curve cryptography is a type of asymmetric or public-key cryptography based on the discrete logarithm problem as expressed by addition and multiplication on the points of an elliptic curve. <> is an example of an elliptic curve, similar to that used by bitcoin. @@ -189,7 +189,7 @@ If P~1~ is the "point at infinity," then the sum P~1~ + P~2~ = P~2~. Similary, i It turns out that pass:[+] is associative, which means that (A pass:[+] B) pass:[+] C = A pass:[+] (B pass:[+] C). That means we can write A pass:[+] B pass:[+] C without parentheses without any ambiguity. -Now that we have defined addition, we can define multiplication in the standard way that extends addition. For a point P on the elliptic curve, if k is a whole number, then kP = P + P + P + ... + P (k times). Note that k is sometimes confusingly called an "exponent" in this case.((("", startref="eliptic04"))) +Now that we have defined addition, we can define multiplication in the standard way that extends addition. For a point P on the elliptic curve, if k is a whole number, then kP = P + P + P + ... + P (k times). Note that k is sometimes confusingly called an "exponent" in this case.((("", startref="eliptic04")))((("", startref="Celliptic04"))) [[public_key_derivation]] ==== Generating a Public Key