In-circuit implementation of GLV. #250
Labels
A-cryptography
Area: Issues and PRs related to Cryptography
A-performance
Area: Performance-related Issues and PRs
C-enhancement
Category: An issue proposing an enhancement or a PR with one
P-low
Priority: Low
It seems that GLV (with no windowing) outperforms windowed multiplication (with window of size
2
) by twice as many savings in terms of R1CS. The tricky part about implementing GLV in circuit is the first step, i.e., the scalar decomposition k -> (k1, k2) because it is performed on the ring of integers and not onFr
. The solution could be to create a structSignedInteger
in the same fashion asUnSignedInteger
ineclair::num
and implement the relevant traits.The mathematical analysis of GLV vs Windowed multiplication:
https://www.notion.so/mantanetwork/Scalar-multiplication-of-elliptic-curves-194a4e70a4f943a7acbab549d4331a4d
The text was updated successfully, but these errors were encountered: