A general 1-out-N OT implementation based on Naor-Pinkas OT construction. See details in Section 3.1 in the Paper.
- no modification, all based on the paper.
- reuse the same constance for each round, by input hash function a random element.
- based on group Gq of prime order, Gq is a subprimegroup of Zp, p–1 is a multiple of q
- input a random element to hash function.
- ecc version