Algorithm 6.2 The GLRB method

˜ ° Input: <sup>A</sup> graph G Vð ; <sup>E</sup>Þ, P<sup>∈</sup> E Fp , l and <sup>m</sup>: Output: The l-tuple of the scalar multiplications h i vP ¼ h v1P; …; v : lPi


The Graphs for Elliptic Curve Cryptography DOI: http://dx.doi.org/10.5772/intechopen.83579

> 5.1 Compute Qj ¼ 2Qj : 5.2 If eij ¼ 1 then Qj ¼ Qj þ P: 5.3 Else go to Step (5.4). 5.4 End if

