Elliptic Curve Cryptography: A Gentle Introduction

Re:Elliptic Curve Cryptography: A Gentle Introduction – Part II by dnautics on Monday May 25, 2015 @05:24PM (#9601812)

Hm. Very good intro to the topic.

One nitpick: Part I says "Thanks to the fact that we are in an abelian group, we can write P + Q + R = 0 as P + Q = –R" I'm pretty sure abelianness is not necessary. P + Q + R = 0 => P + Q + R + -R = 0 + -R => P + Q + 0 = -R => P + Q = -R

[ Parent | on HN ]

Re:Elliptic Curve Cryptography: A Gentle Introduction – Part II by peter2783 on Monday May 25, 2015 @10:31PM (#9602669)

Yes, abelian is not necessary. "P + Q = - R" is not necessary commutative, it is associative.

[ Parent | on HN ]

Re:Elliptic Curve Cryptography: A Gentle Introduction – Part II by arh68 on Monday May 25, 2015 @06:52PM (#9602072)

I agree, this is as good as Elliptic Tales.

As long as we're nitpicking, Taking the definition of cofator just ain't right.

[ Parent | on HN ]