Sorry, of course any Turing complete language are equivalent, so my question is badly phrased. I am starting writing an MSc dissertation on the Elliptic Curve Discrete Logarithm Problem over Finite Fields $\mathbb{F}_p$, ($p$ large prime) which is considered to be computationally infeasible, but two recent papers have made some advances, they both present results using Magma, the main computation work is:
generating random points on an Elliptic Curve over a finite field. $R = aP + bQ$ (a, b random integers)
solving systems of summation polynomial equations (as per your reference). $S_m(X_1,\dots,X_m) = 0$
linear algebra ( using using Gr\"obner basis algorithms )
All the papers I see use Magma, so question is better phrased, if I ask how easy it is for SageMath to do these computations?, in terms of pre-existing functions. UPDATE: I've been told by the author of one of the papers , that I should be able to do this in SageMath.
I could be wrong, but I think you are allowed to edit your own question to provide more details--if possible you should do that rather than update your question in the form of an "answer".
Asked: 2017-12-12 18:14:31 +0200
Seen: 640 times
Last updated: Dec 15 '17
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
What do you mean precisely? Most programming languages are Turing complete (Python is one of them).
For reference, "summation polynomials" are introduced in section 2 of the paper "Summation polynomials and the discrete logarithm problem on elliptic curves" by Igor Semaev, available at https://eprint.iacr.org/2004/031.pdf.
See also a discussion of summation polynomials by Steven Galbraith on "The Elliptic Curve Cryptography blog" .
Sorry, of course any Turing complete language are equivalent, so my question is badly phrased. I am starting writing an MSc dissertation on the Elliptic Curve Discrete Logarithm Problem over Finite Fields 𝔽pFp, (pp large prime) which is considered to be computationally infeasible, but two recent papers have made some advances, they both present results using Magma, the main computation work is: generating random points on an Elliptic Curve over a finite field. R=aP+bQR=aP+bQ (a, b random integers) solving systems of summation polynomial equations (as per your reference). Sm(X1,…,Xm)=0Sm(X1,…,Xm)=0 linear algebra ( using using Gr\"obner basis algorithms ) All the papers I see use Magma, how easy it is for SageMath to do these computations?, in terms of pre-existing functions.