Hyper-and-elliptic-curve cryptography
- 1 August 2014
- journal article
- Published by Wiley in LMS Journal of Computation and Mathematics
- Vol. 17 (A) , 181-202
Abstract
This 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).Keywords
This publication has 25 references indexed in Scilit:
- High-Performance Scalar Multiplication Using 8-Dimensional GLV/GLS Decomposition2013
- Lambda Coordinates for Binary Elliptic Curves2013
- Genus 2 point counting over prime fieldsJournal of Symbolic Computation, 2012
- Constructing pairing-friendly hyperelliptic curves using Weil restrictionJournal of Number Theory, 2011
- Factorization with genus 2 curvesMathematics of Computation, 2009
- Fast genus 2 arithmetic based on Theta functionsJournal of Mathematical Cryptology, 2007
- Constructive and destructive facets of Weil descent on elliptic curvesJournal of Cryptology, 2002
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- Sequences of numbers generated by addition in formal groups and new primality and factorization testsAdvances in Applied Mathematics, 1986
- New directions in cryptographyIEEE Transactions on Information Theory, 1976