Endomorphisms for faster elliptic curve cryptography on a large class of curves

DOI10.1007/S00145-010-9065-YzbMATH Open1258.94036OpenAlexW2064534471WikidataQ61914034 ScholiaQ61914034MaRDI QIDQ451123FDOQ451123

Authors: Steven D. Galbraith, Xibin Lin, Michael Scott 

Publication date: 21 September 2012

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-010-9065-y

Recommendations

• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• scientific article; zbMATH DE number 1842492
• scientific article; zbMATH DE number 2086707
• Efficient computable homomorphisms on Hessian curves
• Efficient point multiplication for elliptic curves over special optimal extension fields

zbMATH Keywords

isogenieselliptic curve cryptographyGLV methodpoint multiplicationmultiexponentiation

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Title not available (Why is that?)
• Twisted Edwards Curves
• Analysis and optimization of elliptic-curve single-scalar multiplication
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Faster Addition and Doubling on Elliptic Curves
• Public Key Cryptography - PKC 2006
• The Eta Pairing Revisited
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• A normal form for elliptic curves
• Title not available (Why is that?)
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Inverted Edwards Coordinates
• Title not available (Why is that?)
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Efficient arithmetic on Koblitz curves
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Title not available (Why is that?)
• Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields
• Title not available (Why is that?)
• Exponentiation in Pairing-Friendly Groups Using Homomorphisms
• Title not available (Why is that?)
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• Title not available (Why is that?)
• On the static Diffie-Hellman problem on elliptic curves over extension fields
• Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems
• A double large prime variation for small genus hyperelliptic index calculus
• Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
• Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography
• Title not available (Why is that?)
• Accelerated Verification of ECDSA Signatures
• Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem

Cited In (36)

• Index calculus in the trace zero variety
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Efficiently computable endomorphism for genus 3 hyperelliptic curve cryptosystems
• Revocable hierarchical identity-based authenticated key exchange
• Fast Elliptic-Curve Cryptography on the Cell Broadband Engine
• A multivariate encryption scheme with Rainbow
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• Secure and Efficient Pairing at 256-Bit Security Level
• Implementing the 4-dimensional GLV method on GLS elliptic curves with \(j\)-invariant 0
• Cryptography on twisted Edwards curves over local fields
• Title not available (Why is that?)
• Fast cryptography in genus 2
• Algorithmic Number Theory
• An optimal representation for the trace zero subgroup
• Subgroup security in pairing-based cryptography
• The pairing computation on Edwards curves
• Ready-made short basis for GLV+GLS on high degree twisted curves
• A new twofold Cornacchia-type algorithm and its applications
• Point compression for the trace zero subgroup over a small degree extension field
• On the optimization of Pippenger's bucket method with precomputation
• Fast endomorphisms in integer sub-decomposition method on Secp192k1
• Making the identity-based Diffie-Hellman key exchange efficiently revocable
• Title not available (Why is that?)
• Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
• The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves
• Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
• Efficient point multiplication for elliptic curves over special optimal extension fields
• Pairing computation on Edwards curves with high-degree twists
• Generalised Mersenne numbers revisited
• A New Encoding Algorithm for a Multidimensional Version of the Montgomery Ladder
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
• Families of fast elliptic curves from \(\mathbb Q\)-curves
• Efficiently computable complex multiplication of elliptic curves
• Extending the GLS endomorphism to speed up GHS Weil descent using Magma
• A note on inverted twisted Edwards curve

Uses Software

• EFD
• MIRACL
• eBASH
• mpFq
• eBACS
• eBATS
• Curve25519

This page was built for publication: Endomorphisms for faster elliptic curve cryptography on a large class of curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q451123)