Login / Signup

Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree.

Sorina IonicaAntoine Joux
Published in: Pairing (2010)
Keyphrases
  • elliptic curve
  • efficiently computable
  • efficient computation
  • upper bound
  • sufficient conditions
  • scalar multiplication
  • multi class
  • computationally hard
  • diffie hellman