I want to know if the below algorithm , secure against quantum computing attack No, it's not secure against Quantum Computers. To quote the text: the secret key is $sk = x \in_R \mathbb{Z}_p$ and the public key is $pk = (g, v = g^x)$. Shor's algorithm will directly recover the secret key from the public key; that runs in polynomial time.

Only top voted, non community-wiki answers of a minimum length are eligible