Package dk.jonaslindstrom.ruffini.elliptic.algorithms

Class MillersAlgorithm<E>

java.lang.Object

dk.jonaslindstrom.ruffini.elliptic.algorithms.MillersAlgorithm<E>

All Implemented Interfaces:

TriFunction<AffinePoint<E>,AffinePoint<E>,BigInteger,E>

public class MillersAlgorithm<E>
extends Object
implements TriFunction<AffinePoint<E>,AffinePoint<E>,BigInteger,E>

Given two points P and Q of order m on an elliptic curve, this algorithm computes f(Q) where div(f) = [m]P - m[O]. It is used in WeilPairing.

Constructor Summary

Constructors

Constructor	Description
MillersAlgorithm(ShortWeierstrassCurveAffine<E,?> curve)

Method Summary

Modifier and Type	Method	Description
E	apply(AffinePoint<E> P, AffinePoint<E> Q, BigInteger m)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

MillersAlgorithm

public MillersAlgorithm(ShortWeierstrassCurveAffine<E,?> curve)

Method Details

apply

public E apply(AffinePoint<E> P,
 AffinePoint<E> Q,
 BigInteger m)

Specified by:

apply in interface TriFunction<AffinePoint<E>,AffinePoint<E>,BigInteger,E>