summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAndreas Schneider <asn@cryptomilk.org>2015-01-06 15:22:16 +0100
committerAndreas Schneider <asn@cryptomilk.org>2015-01-06 15:22:16 +0100
commit3dd069c0c85732b254e2b6e72f8a8541b1665911 (patch)
treeca740843f6af802ccf73a60194ab72d13b033d27
parenta198193723b6a17668e95163df9a9de23f66b62f (diff)
downloadlibssh-3dd069c0c85732b254e2b6e72f8a8541b1665911.tar.gz
libssh-3dd069c0c85732b254e2b6e72f8a8541b1665911.tar.bz2
libssh-3dd069c0c85732b254e2b6e72f8a8541b1665911.zip
doc: Fix a typo, blank lines and trailing spaces.
-rw-r--r--doc/curve25519-sha256@libssh.org.txt14
1 files changed, 7 insertions, 7 deletions
diff --git a/doc/curve25519-sha256@libssh.org.txt b/doc/curve25519-sha256@libssh.org.txt
index e68dc5e6..baa2ca41 100644
--- a/doc/curve25519-sha256@libssh.org.txt
+++ b/doc/curve25519-sha256@libssh.org.txt
@@ -1,6 +1,6 @@
curve25519-sha256@libssh.org.txt Aris Adamantiadis <aris@badcode.be>
21/9/2013
-
+
1. Introduction
This document describes the key exchange methode curve25519-sha256@libssh.org
@@ -28,8 +28,8 @@ lack of nebulous hard-coded constants.
The reference version being used in this document is the one described in
[Curve25519] as implemented in the library NaCl [NaCl].
-This document does not attempts to provide alternatives to the ecdsa-sha1-*
-authentication keys.
+This document does not attempt to provide alternatives to the ecdsa-sha1-*
+authentication keys.
2. Key exchange
@@ -99,7 +99,7 @@ It should be noted that, in opposition to NIST curves, no special validation
should be done to ensure the received public keys are valid curves point. The
Curve25519 algorithm ensure that every possible public key maps to a valid
ECC Point.
-
+
4.3 Shared secret generation
The shared secret, k, is defined in SSH specifications to be a big integer.
@@ -107,7 +107,7 @@ This number is calculated using the following procedure:
X is the 32 bytes point obtained by the scalar multiplication of the other
side's public key and the local private key scalar.
-
+
The whole 32 bytes of the number X are then converted into a big integer k.
This conversion follows the network byte order. This step differs from
RFC5656.
@@ -115,5 +115,5 @@ This number is calculated using the following procedure:
[RFC5656] http://tools.ietf.org/html/rfc5656
[SCHNEIER] https://www.schneier.com/blog/archives/2013/09/the_nsa_is_brea.html#c1675929
[DJB] http://cr.yp.to/talks/2013.05.31/slides-dan+tanja-20130531-4x3.pdf
-[Curve25519] "Curve25519: new Diffie-Hellman speed records."
- http://cr.yp.to/ecdh/curve25519-20060209.pdf \ No newline at end of file
+[Curve25519] "Curve25519: new Diffie-Hellman speed records."
+ http://cr.yp.to/ecdh/curve25519-20060209.pdf