Question

Computer Science
(3) Let E be the elliptic curve y=x+2+26 mod 127, where [E]=131.
(as Explain the ECDSA algorithm.
(b) Suppose that the ECDSA is implemented in E with A= (2.6) and
m = 54.
(b-1) Compute the public key B=mA.
[10]
(b-2) Compute the signature on a message z if SHA-1(x)= 10.
when k= 75.
[10]
(b-3) Show the computations used to verify the signature constructed
in part (b-1).​

Answer 1

Answer:

bhai Google pe search karo mil jayega