Ruholla Khodakaramian Gilan

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper provides a polynomial time algorithm for finding integer number d such that T = dS in the group of &#x211A;-rational points on a given elliptic curve E defined over &#x211A; (ECDLP) where T, S &#x03F5; E (&#x211A;). In this method, first we determine the biggest integer number n such that S &#x03F5; 2<sup>n</sup>E(&#x211A;) and then using halving(More)
  • 1