ginger-lib
ginger-lib copied to clipboard
Complete EC addition circuits
When it comes to complete addition gadgets, I expect that we can do better than the "naive" approach using the infinity flag of the AffineGadget. Let us investigate efficient complete arithmetics within circuit:
- Which projective representation has the most efficient complete addition formulas?
- Is mixed arithmetics useful for us?
- Are there other practical approaches for avoiding exceptions (such as random shifts, e.g.)?