11 reputation
1
bio website
location
age
visits member for 1 year, 7 months
seen May 29 '13 at 19:33

May
27
comment What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?
You can contact me using the direct messages feature (I'm user RichardX) in Bitcointalk.org. Thanks
May
26
comment What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?
I cannot tell you it's (a) nor (c) nor (d). Then that might leave us with only (b).
May
24
comment What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?
I cannot describe the problem I want to solve in more detail due to confidentiality restrictions.
May
24
comment What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?
Yes, this is Bitcoin related. So apparently Secp256k1 is not a Koblitz curve. A forum posts says it is a "curve over F_p which possess an efficiently computable endomorphism.".
May
23
comment What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?
Yes, I need a way to track a point back to source points P1, P2, Pn (with a known relation) and that's why I had though about a linear function F on the previous points.
May
23
awarded  Student
May
22
asked What is the fastest elliptic curve operation f(P) in affine coordinates such that f^n(P)=P only if n is large?