Shared secret computation #355
Unanswered
robertsdotpm
asked this question in
Q&A
Replies: 1 comment
-
It's just a choice, shared point only is also fine. Since we use KDF to derive the symmetric key, longer (ie more entropy) is better |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Hello,
Just a quick question:
I see in the code that a shared point is computed
shared_point = peer_public_key.multiply(private_key.secret)
But then the public key is added to the shared point. Why is that last step necessary? I looked at ECDH and it just mentioned the first steps (the multiply.) Is the add necessary?
Beta Was this translation helpful? Give feedback.
All reactions