| Math::Prime::Util::ECProjectivePoint(3pm) | User Contributed Perl Documentation | Math::Prime::Util::ECProjectivePoint(3pm) |
Math::Prime::Util::ECProjectivePoint - Elliptic curve operations for projective points
Version 0.73
# Create a point on a curve (a,b,n) with coordinates 0,1 my $ECP = Math::Prime::Util::ECProjectivePoint->new($c, $n, 0, 1); # scalar multiplication by $k. $ECP->mul($k); # add two points on the same curve $ECP->add($ECP2); say "P = O" if $ECP->is_infinity();
This really should just be in Math::EllipticCurve.
To write.
$point = Math::Prime::Util::ECProjectivePoint->new(c, n, x, z);
Returns a new point on the curve defined by the Montgomery parameter c.
Returns the "c", "d", or "n" values that describe the curve.
Returns the precalculated value of "int( (c + 2) / 4 )".
Returns the "x" or "z" values that define the point on the curve.
Returns a possible factor found after "normalize".
Takes another point on the same curve as an argument and adds it this point.
Double the current point on the curve.
Takes an integer and performs scalar multiplication of the point.
Returns true if the point is (0,1), which is the point at infinity for the affine coordinates.
Returns a copy of the point.
Performs an extended GCD operation to make "z=1". If a factor of "n" is found it is put in "f".
Math::EllipticCurve::Prime
This really should just be in a Math::EllipticCurve module.
Dana Jacobsen <dana@acm.org>
Copyright 2012-2013 by Dana Jacobsen <dana@acm.org>
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
| 2022-10-20 | perl v5.36.0 |