Feat/pedersen commitment

[wfnuser]

• Add PedersenParams class with G and H generators
• Create commit function using Pedersen Commitment scheme
• Implement Prover and Verifier classes for Pederson Commitment Protocol
• Add run_pedersen function to demonstrate the protocol flow
• Include simulate function for to prove zero-knowledge
• Implement extract function to prove soundness

The diagram will visually represent the 3-round interaction:

    Prover -> (r, r_rho) -> Verifier
    Verifier -> c -> Prover
    Prover -> (z, z_rho) -> Verifier
    Where z = r + c * sk and z_rho = r_rho + c * rho

The Verifier should verify that the commitment is correct, i.e., $$[z;z{\rho}] ?= [r;r{\rho}] + c * PK$$