Skip to content

Commit c7d900f

Browse files
committed
doc: minor ellswift.md updates
1 parent 0fa84f8 commit c7d900f

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

doc/ellswift.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -88,7 +88,7 @@ $$
8888
\begin{array}{lcl}
8989
X(u, t) & = & \left\\{\begin{array}{ll}
9090
\dfrac{g(u) - t^2}{2t} & a = 0 \\
91-
\dfrac{g(u) + h(u)(Y_0(u) + X_0(u)t)^2}{X_0(u)(1 + h(u)t^2)} & a \neq 0
91+
\dfrac{g(u) + h(u)(Y_0(u) - X_0(u)t)^2}{X_0(u)(1 + h(u)t^2)} & a \neq 0
9292
\end{array}\right. \\
9393
Y(u, t) & = & \left\\{\begin{array}{ll}
9494
\dfrac{X(u, t) + t}{u \sqrt{-3}} = \dfrac{g(u) + t^2}{2tu\sqrt{-3}} & a = 0 \\
@@ -329,7 +329,7 @@ $t$ value for multiple $c$ inputs (thereby biasing that encoding):
329329
it requires $g(u)=0$ which is already outlawed on even-ordered curves and impossible on others; in the second it would trigger division by zero.
330330
* Curve-specific special cases also exist that need to be rejected, because they result in $(u,t)$ which is invalid to the decoder, or because of division by zero in the encoder:
331331
* For $a=0$ curves, when $u=0$ or when $t=0$. The latter can only be reached by the encoder when $g(u)=0$, which requires an even-ordered curve.
332-
* For $a \neq 0$ curves, when $X_0(u)=0$, when $h(u)t^2 = -1$, or when $2w(u + 2v) = 2X_0(u)$ while also either $w \neq 2Y_0(u)$ or $h(u)=0$.
332+
* For $a \neq 0$ curves, when $X_0(u)=0$, when $h(u)t^2 = -1$, or when $w(u + 2v) = 2X_0(u)$ while also either $w \neq 2Y_0(u)$ or $h(u)=0$.
333333

334334
**Define** a version of $G_{c,u}(x)$ which deals with all these cases:
335335
* If $a=0$ and $u=0$, return $\bot.$

include/secp256k1_ellswift.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -161,7 +161,7 @@ SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ellswift_create(
161161
/** Given a private key, and ElligatorSwift public keys sent in both directions,
162162
* compute a shared secret using x-only Elliptic Curve Diffie-Hellman (ECDH).
163163
*
164-
* Returns: 1: shared secret was succesfully computed
164+
* Returns: 1: shared secret was successfully computed
165165
* 0: secret was invalid or hashfp returned 0
166166
* Args: ctx: pointer to a context object.
167167
* Out: output: pointer to an array to be filled by hashfp.

0 commit comments

Comments
 (0)