Algorithm 2: Signature and Verification of the Scheme.

func Sign (M string, d string, k string)(r string, s string){

$(x,y)=k\times G$;

$z\leftarrow h(M)$;

$r\leftarrow x mod n, s\leftarrow k^{-1}(z+r\times d) mod n$;

return $r,s$

}

func Verify (z string, r string, s string, Q string) (result string){

$u_1\leftarrow z\times s^{-1} mod n$

$u_2\leftarrow r\times s^{-1} mod n$

$(x^{\prime },y^{\prime })=u_1*G+u_2*Q$

if$x^{\prime }==r mod n$then

return “valid”

else

return “invalid”

end

}