IEEE Transactions on Information Theory · 1999 · 241 citations · 4 references
ComputingComputer ScienceMathematicsCryptographyDiscrete MathematicsElliptic Curve CryptographyElliptic CurvesDiscrete Logarithm AlgorithmsDiscrete Logarithm ProblemElliptic Curve ArithmeticElliptic Curve Discrete Logarithm ProblemElliptic Curve GroupsElliptic Curve PairingsFinite Field ArithmeticPairing-based Cryptography
The Tate pairing is used to reduce the discrete logarithm (DL) problem on certain elliptic curves to the DL in the multiplicative group of finite fields.
4