On the Wikipedia page for commitment scheme there is an example that refers to a pseudo random number generator G that takes n bits to 3n bits. What is an example of an algorithm that fits this description that could be used in a real world implementation of this protocol. Bonus points if there is an existing Rust implementation/library or if it is easy to write an implementation for.
Aucun commentaire:
Enregistrer un commentaire