Uses of Record Class
dk.jonaslindstrom.ruffini.elliptic.elements.AffinePoint
Packages that use AffinePoint
Package
Description
-
Uses of AffinePoint in dk.jonaslindstrom.ruffini.elliptic.algorithms
Methods in dk.jonaslindstrom.ruffini.elliptic.algorithms with parameters of type AffinePointModifier and TypeMethodDescriptionMillersAlgorithm.apply
(AffinePoint<E> P, AffinePoint<E> Q, BigInteger m) WeilPairing.apply
(AffinePoint<E> P, AffinePoint<E> Q, AffinePoint<E> S, int m) WeilPairing.apply
(AffinePoint<E> P, AffinePoint<E> Q, AffinePoint<E> S, BigInteger m) Assume S is not in {O, P, -Q, P-Q}.OptimalAtePairing.lineFunction
(AffinePoint<E2> Q1, AffinePoint<E2> Q2, AffinePoint<E1> P) OptimalAtePairing.pairing
(AffinePoint<E1> P, AffinePoint<E2> Q, List<Integer> ci) -
Uses of AffinePoint in dk.jonaslindstrom.ruffini.elliptic.elements
Methods in dk.jonaslindstrom.ruffini.elliptic.elements that return AffinePointModifier and TypeMethodDescription<F> AffinePoint<F>
static <F> AffinePoint<F>
AffinePoint.pointAtInfinity()
JacobianPoint.toAffinePoint
(Field<E> field) ProjectivePoint.toAffinePoint
(Field<E> field) -
Uses of AffinePoint in dk.jonaslindstrom.ruffini.elliptic.structures
Fields in dk.jonaslindstrom.ruffini.elliptic.structures declared as AffinePointMethods in dk.jonaslindstrom.ruffini.elliptic.structures that return AffinePointModifier and TypeMethodDescriptionMontgomeryCurve.add
(AffinePoint<E> p, AffinePoint<E> q) ShortWeierstrassCurveAffine.add
(AffinePoint<E> p, AffinePoint<E> q) Curve25519.decodePoint
(byte[] bytes) MontgomeryCurve.negate
(AffinePoint<E> p) ShortWeierstrassCurveAffine.negate
(AffinePoint<E> p) MontgomeryCurve.zero()
ShortWeierstrassCurveAffine.zero()
Methods in dk.jonaslindstrom.ruffini.elliptic.structures that return types with arguments of type AffinePointModifier and TypeMethodDescriptionPair<MontgomeryCurve<E,
F>, java.util.function.Function<EdwardsPoint<E>, AffinePoint<E>>> EdwardsCurve.getCorrespondingMontgomeryCurve()
Return an elliptic curve in Montgomery form which is birationally equivalent to this curve and a mapping from points on this curve to points on the Montgomery curve.Pair<ShortWeierstrassCurveAffine<E,
F>, java.util.function.UnaryOperator<AffinePoint<E>>> MontgomeryCurve.getCorrespondingWeierstrassCurve()
Methods in dk.jonaslindstrom.ruffini.elliptic.structures with parameters of type AffinePointModifier and TypeMethodDescriptionMontgomeryCurve.add
(AffinePoint<E> p, AffinePoint<E> q) ShortWeierstrassCurveAffine.add
(AffinePoint<E> p, AffinePoint<E> q) static byte[]
Curve25519.encodePoint
(AffinePoint<BigInteger> point) boolean
MontgomeryCurve.equals
(AffinePoint<E> a, AffinePoint<E> b) boolean
ShortWeierstrassCurveAffine.equals
(AffinePoint<E> a, AffinePoint<E> b) MontgomeryCurve.negate
(AffinePoint<E> p) ShortWeierstrassCurveAffine.negate
(AffinePoint<E> p) MontgomeryCurve.toString
(AffinePoint<E> a) ShortWeierstrassCurveAffine.toString
(AffinePoint<E> a) -
Uses of AffinePoint in dk.jonaslindstrom.ruffini.elliptic.structures.bls12381
Fields in dk.jonaslindstrom.ruffini.elliptic.structures.bls12381 declared as AffinePointModifier and TypeFieldDescriptionstatic AffinePoint<BigInteger>
BLS12381.G1_GENERATOR
Generator for the G1 subgroup of order q.static AffinePoint<Polynomial<BigInteger>>
BLS12381.G2_GENERATOR
Fields in dk.jonaslindstrom.ruffini.elliptic.structures.bls12381 with type parameters of type AffinePointModifier and TypeFieldDescriptionstatic java.util.function.BiFunction<AffinePoint<BigInteger>,
AffinePoint<Polynomial<BigInteger>>, Polynomial<Polynomial<Polynomial<BigInteger>>>> BLS12381.PAIRING
The optimal Ate pairing which is a bilinear function e: G1 x G2 → GT.static java.util.function.BiFunction<AffinePoint<BigInteger>,
AffinePoint<Polynomial<BigInteger>>, Polynomial<Polynomial<Polynomial<BigInteger>>>> BLS12381.PAIRING
The optimal Ate pairing which is a bilinear function e: G1 x G2 → GT.Methods in dk.jonaslindstrom.ruffini.elliptic.structures.bls12381 that return AffinePointModifier and TypeMethodDescriptionstatic AffinePoint<BigInteger>
Serialization.deserializeG1
(byte[] bytes) static AffinePoint<Polynomial<BigInteger>>
Serialization.deserializeG2
(byte[] bytes) Methods in dk.jonaslindstrom.ruffini.elliptic.structures.bls12381 with parameters of type AffinePointModifier and TypeMethodDescriptionstatic byte[]
Serialization.serializeG1
(AffinePoint<BigInteger> point, boolean compress) static byte[]
Serialization.serializeG2
(AffinePoint<Polynomial<BigInteger>> point, boolean compressed) static SamePair<Polynomial<Polynomial<Polynomial<BigInteger>>>>
BLS12381.twist
(AffinePoint<BigInteger> p) -
Uses of AffinePoint in dk.jonaslindstrom.ruffini.elliptic.structures.bn254
Fields in dk.jonaslindstrom.ruffini.elliptic.structures.bn254 declared as AffinePointModifier and TypeFieldDescriptionstatic AffinePoint<BigInteger>
BN254.G1_GENERATOR
Generator for the G1 subgroup of order q.static AffinePoint<Polynomial<BigInteger>>
BN254.G2_GENERATOR
Fields in dk.jonaslindstrom.ruffini.elliptic.structures.bn254 with type parameters of type AffinePointModifier and TypeFieldDescriptionstatic java.util.function.BiFunction<AffinePoint<BigInteger>,
AffinePoint<Polynomial<BigInteger>>, Polynomial<Polynomial<Polynomial<BigInteger>>>> BN254.PAIRING
The optimal Ate pairing which is a bilinear function e: G1 x G2 → GT.static java.util.function.BiFunction<AffinePoint<BigInteger>,
AffinePoint<Polynomial<BigInteger>>, Polynomial<Polynomial<Polynomial<BigInteger>>>> BN254.PAIRING
The optimal Ate pairing which is a bilinear function e: G1 x G2 → GT.Methods in dk.jonaslindstrom.ruffini.elliptic.structures.bn254 with parameters of type AffinePointModifier and TypeMethodDescriptionstatic SamePair<Polynomial<Polynomial<Polynomial<BigInteger>>>>
BN254.twist
(AffinePoint<BigInteger> p)