Skip to content

Commit 5403b51

Browse files
committed
inscribing the target: better wording for converse
1 parent 3377d6a commit 5403b51

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

ch03.asciidoc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -702,8 +702,8 @@ If we know _e_, we have:
702702
703703
This means that any (_u_,_v_) combination that satisfies the preceding equation will suffice.
704704
705-
If we don't know _e_, we'll have to play with (_u_,_v_) until __e = (k–u)/v__.
706-
If we could solve this with any (_u_,_v_) combination, that would mean we'd have solved _P_ = _eG_ while knowing only _P_ and _G_.
705+
Now suppose we don't know _e_, but we can solve __uG + vP = kG__ with some (_u_,_v_) combination.
706+
Then __e = (k–u)/v__ gives a solution to _P_ = _eG_ while knowing only _P_ and _G_.
707707
In other words, we'd have broken the discrete log problem.
708708
709709
This means to provide a correct _u_ and _v_, we either have to break the discrete log problem or know the secret _e_.

0 commit comments

Comments
 (0)