Quintic point group operation: Difference between revisions

From Elliptic Curve Crypto
inverse
Undo revision 220 by Rational Point (talk)
Tag: Undo
Line 33: Line 33:


The goal is to reach the point <math>-P</math> from the point ''P'' alone, and to reach the point <math>P+Q</math> from the points ''P'' and ''Q'' if possible, and if so, by the shortest possible path of computation, i.e., using the least number of elliptic curve fittings.
The goal is to reach the point <math>-P</math> from the point ''P'' alone, and to reach the point <math>P+Q</math> from the points ''P'' and ''Q'' if possible, and if so, by the shortest possible path of computation, i.e., using the least number of elliptic curve fittings.
=== Additive inverse ===
The additive [[point group operation]] inverse of the point ''P'' is calculated
:<math>-P=-\frac23\left(-2\left(-\frac32P+\left(-\frac14P\right)\right)\right)</math>
using no fewer than four elliptic curve fittings over the quintic curve.

Revision as of 19:18, 6 January 2025

Suppose we have a quintic curve in the form

.

Through any four points on a quintic curve in this form, an ordinary elliptic curve in the form

may be fitted, and this elliptic curve must intersect the quintic curve at a fifth point, uniquely determined, up to sign of the y-axis.

The quincunx equations

If P, Q, R, S and T are the five points of intersection between the quintic curve and the fitted elliptic curve, permitting multiplicity, let

,

where O is the additional “point at infinity” considered to lie on the curve and serve as an identity for its additive point group operation.

Curve fittings through one point

Choose a point P and solve , , and by curve-fitting. Now , , , and .

Curve fittings through two points

Choosing points P and Q it is possible to solve for and by curve-fitting: and , if scalar division is permitted. Also and so and , etc.

Goals and objectives

The goal is to reach the point from the point P alone, and to reach the point from the points P and Q if possible, and if so, by the shortest possible path of computation, i.e., using the least number of elliptic curve fittings.