Skip to main content
Article thumbnail
Location of Repository

An Optimal Algorithm for Left-to-Right Signed-Binary Representation of Four Integers

By K. Pradheep Kumar


Abstract-In elliptic curve cryptography, the problem of computing an integer k from two points on the ellipse namely kp, p the computation of ap+bq+cr+ds, is performed from Shamir’s method. In this paper an algorithm is proposed for computing the minimum joint weight for the integers a, b, c, d, examining them from left to right. Keywords—ECC protocol, JSF algorithm, joint weight, optimality, ISB representation, SB representation, SB bit

Topics: I
Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.