how diffie hellman key exchange works
-
how diffie hellman key exchange works
(with as little math as possible)
@b0rk I would boost it, but the attached image doesn't have any alt text, so I can't. What's the image about? is it showing a mathematical formula or something similar? a diagram?
-
@b0rk I would boost it, but the attached image doesn't have any alt text, so I can't. What's the image about? is it showing a mathematical formula or something similar? a diagram?
@esoteric_programmer will write some and let you know when it’s added
-
how diffie hellman key exchange works
(with as little math as possible)
@b0rk I love it. when I have taught this material, I have fallen back on the paint mixing analogy, but as a colorblind person this never felt right!
-
how diffie hellman key exchange works
(with as little math as possible)
@b0rk am I missing something or is "add the result s to itself x times) a result of mixed-up puncutation? Did a double-take at that
-
@b0rk am I missing something or is "add the result s to itself x times) a result of mixed-up puncutation? Did a double-take at that
@b0rk fantastic work as usual, thanks for sharing
-
@divVerent ah yeah good point! do you know an example offhand where you can find (S o A) o B given S o A and S o B? (but not find B given S o B)
@b0rk@social.jvns.ca No such groups are known yet. However one can easily prove that discrete log solves CDH, whereas no general reduction from CDH to discrete log exists, which in a way tells that DL is a "harder or equivalent" problem.
There exists however such a reduction for some elliptic curves (e.g. the NIST curves and Curve25519); these curves are usually preferred, as we then only depend on one problem being hard. -
how diffie hellman key exchange works
(with as little math as possible)
@b0rk that’s a great explainer. You made it straightforward for me to understand how it works without having to know how the functions involved work (I don’t).
And the keys are for symmetric encryption, I guess? -
@b0rk am I missing something or is "add the result s to itself x times) a result of mixed-up puncutation? Did a double-take at that
@SnoopJ what do you mean by mixed up punctuation?
it’s trying to explain how on an elliptic curve, you start with an initial point s on the elliptic curve, choose a random integer x , and then add that point s to itself x times (using elliptic curve addition) to get the result of the “magic function”
-
-
how diffie hellman key exchange works
(with as little math as possible)
@b0rk like how you used 'hard to undo'. I used to explain it by saying the inverse is really hard to do but that explanation is simpler.
-
how diffie hellman key exchange works
(with as little math as possible)
-
how diffie hellman key exchange works
(with as little math as possible)
@b0rk The Wikipedia article uses a color-mixing analogy that I've always liked. I used to know someone who would do the color-mixing thing live in a class she taught!
