Hyper-and-elliptic-curve cryptography

Daniel J. Bernstein, Tanja Lange
2014 LMS Journal of Computation and Mathematics  
AbstractThis paper introduces 'hyper-and-elliptic-curve cryptography', in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (for example, Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (for example, key generation) and multi-scalar multiplication (for example, signature verification).
doi:10.1112/s1461157014000394 fatcat:suerpr247zfo7jafgduxj2vnji