Youssef El Housni
Youssef El Housni
Normally, affine coordinates should yield a faster pairing over SW6 if the inverse is implemented using the norm map as suggested in [[1](https://eprint.iacr.org/2010/363.pdf), [2](https://eprint.iacr.org/2011/334.pdf), [3](https://eprint.iacr.org/2013/722.pdf)]. But I think it's not...
> Do any of the curves have hash to curve? Can we collate some resources for the different curves? I don't know much about it. [BW6-761](https://eprint.iacr.org/2020/351.pdf) uses [Elligator-2](https://elligator.cr.yp.to/elligator-20130828.pdf) for G1...
The cost of bucket-list MSM is roughly: `b/c*(n+2^c)` additions where `n` is the number of points, `b` the bitsize of scalars and `c` the chosen window bitsize. For large instances,...
TODO: needs some code generation
https://eccc.weizmann.ac.il/report/2022/110/
Also on `Fr` of all curves, which is needed for decompressing points of associated twisted Edwards curves. This in particular would be beneficial for Bandersnatch-based Verkle trees.
> Hi! Has this been or being worked on ? In case it hasn't been (or isn't being), I would like to take a stab at it, given that it's...
> The Miller `2^n-tuple-and-add` Algorithm (Algorithm 2 in the paper) defines the loop counter as `m = (ml−1...m1, m0)2^n` but its representation doesn't have to be changed does it for...
Needs #312 and #313 to be merged