Elliptic Curve Diffie Hellman | đường cong elliptic

đường cong elliptic. Có phải bạn đang tìm kiếm chủ đề về Elliptic Curve Diffie Hellman phải không? Nếu đúng như vậy thì mời bạn xem nó ngay tại đây. Xem thêm các video thú vị tại website

VIDEO Elliptic Curve Diffie Hellman

đường cong elliptic



A short video I put together that describes the basics of the Elliptic Curve Diffie-Hellman protocol for key exchanges.

There is an error at around 5:30 where I state that the point at infinity is the result of point-doubling a point whose X coordinate is zero. This is incorrect, it should be when the Y coordinate is zero.

Also I state ‘geographically’ instead of ‘geometrically’.

Picture Elliptic Curve Diffie Hellman

Tag Elliptic Curve Diffie Hellman

đường cong elliptic,Elliptic Curve Cryptography

Xem thêm bài viết thuộc chuyên mục: Crypto

44 bình luận về “Elliptic Curve Diffie Hellman | đường cong elliptic”

  1. How does Bob know 9A is 27G? Since Alice didn't share the private key "beta", Bob will only know he has to do 9 * (7,6). So the question is how does Bob calculate 9 * (7, 6) ?

  2. Even after six years… Still the best, and by far, simple explanation of elliptic curve cryptography. No way too complicated math statements and no oversimplified kids drawing explaining what a public key is.

    Many thanks 😀

  3. Nice video. Would have been even nicer if you could have plug in the "algebraic solution of the product" into the equation so the people would see that this is actually on the curve. Otherwise it just falls from the sky

  4. Wouldn't the scalar multiplication need to be optimized more than just P+P+P… k times. I would think an initial list of points {2P=P+P, 4P=2P+2P, 8P=4P+4P… } so that the addition could just sum powers of 2. Making scalar multiplication O(logN) in one direction and O(n) in the other, giving a nice DLP.

Bình luận đã đóng.