| # Based on https://github.com/kobigurk/circomlib/blob/feature/mimcsponge/circuits/mimcsponge.circom | |
| from sha3 import keccak_256 | |
| SNARK_SCALAR_FIELD = 0x30644e72e131a029b85045b68181585d2833e84879b9709143e1f593f0000001 | |
| DEFAULT_SEED = b"mimcsponge" | |
| DEFAULT_ROUNDS = 220 | |
| DEFAULT_p = SNARK_SCALAR_FIELD |
| function scalarMultNAF(uint256 x, uint256 y, uint256 value) | |
| internal view returns (uint256, uint256) | |
| { | |
| uint256 booth_double = 2*value; | |
| require( booth_double > value ); | |
| uint256 a = 1<<255; | |
| uint256 i = 0xFF; | |
| // Window, [-1, R, 1], where R stores the result/accumulator |
| >>> FQ._reset_counts() | |
| >>> mult_naf(Point.generator().as_etec(), x).as_point() | |
| Point(x=18987354351012593630129515515975733900217139077132107335425740392119527171078, y=11428057720979390895821506067617152623056492299921105588788883268262875559933) | |
| >>> FQ._print_counts() | |
| add = 768 | |
| inv = 1 | |
| mul = 3491 |
| RandomBinaryVector = lambda length: vector(G, [randint(0,1) for _ in range(length)]) | |
| EuclideanNorm = lambda _: int(sqrt(sum([int(i)**2 for i in _]))) | |
| n = k = 128 | |
| q = 1244142437461793964053 | |
| m = 9088 | |
| beta = 9.71468927453313e18 | |
| G = GF(q) | |
| A = MatrixSpace(G, n, m).random_element() |
| from functools import reduce | |
| import binascii | |
| from os import urandom | |
| from py_ecc.bn128 import * | |
| from sha3 import keccak_256 | |
| """ | |
| Implements BLS signatture aggregation as described at: | |
| https://crypto.stanford.edu/~dabo/pubs/papers/BLSmultisig.html |
| # https://webdocs.cs.ualberta.ca/~you/courses/325/Mynotes/Fun/SECD-slides.html | |
| from pampy import match, ANY, REST | |
| CAR = lambda s: [s[0][0]] + s[1:] | |
| CDR = lambda s: [s[0][1:]] + s[1:] | |
| ADD = lambda s: [s[0] + s[1]] + s[2:] | |
| MUL = lambda s: [s[0] * s[1]] + s[2:] | |
| DIV = lambda s: [s[0] / s[1]] + s[2:] | |
| EQ = lambda s: [s[0] == s[1]] + s[2:] |
| # Papers | |
| # | |
| # https://cims.nyu.edu/~regev/papers/average.pdf | |
| # https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-007/Paper.pdf (Ajtai's paper) | |
| # https://eprint.iacr.org/2018/857.pdf | |
| # | |
| # https://web.eecs.umich.edu/~cpeikert/pubs/slides-abit5.pdf | |
| # - notes that column-wise multiplication is not sure | |
| # - not collision resistant | |
| # |
| pragma solidity ^0.5.0; | |
| contract MillerRabin | |
| { | |
| function modexp_rsa2048(uint256[8] memory b, uint256 e) | |
| public view returns(uint256[8] memory result) | |
| { | |
| bool success; | |
| assembly { | |
| let freemem := mload(0x40) |
Good Overviews:
| from copy import copy | |
| from ethsnarks.field import FQ | |
| def validate_one_zero(one, zero, negone): | |
| # Eliminates the case one=0, zero=1 | |
| if one * zero != zero: | |
| return False | |
| # Eliminates the case one=1, zero=1 |
