Zero knowledge primitives

[Shimuuar]

We need Non-interactive sigma-protocols

• [ ] A proof of knowledge of discrete logarithm with respect to fixed group generator
• [ ] A proof of equality of discrete lograithms

[Shimuuar]

Here is list of cryptographic primitives needed for implementation of Σ-protocols. Ergo papers are silent about choice of group for use in algorithm. I had to look through sources. It looks like they use secp256k1. So to implement primitives we need:

• [ ] Operations on points on EC. Most likely secp256k1 but other choices are possible. This is problem for GHCJS/android/iOS. cryptonite has necessary operations but unusable on these platforms
• [ ] Bit vectors of fixed width. 256 bit I think
• [ ] Operation on finite fields GF(2^n). Those are only needed for THRESHOLD connective and could be implemented after we get AND/OR connectives working