Faster Addition and Doubling on Elliptic Curves

DOI10.1007/978-3-540-76900-2_3zbMath1153.11342DBLPconf/asiacrypt/BernsteinL07OpenAlexW2154290215WikidataQ56688363 ScholiaQ56688363MaRDI QIDQ5387091

Tanja Lange, Daniel J. Bernstein

Publication date: 15 May 2008

Published in: Advances in Cryptology – ASIACRYPT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-76900-2_3

zbMATH Keywords

performance evaluationadditionexplicit formulasscalar multiplicationefficient implementationdoublingElliptic curvesregister allocationcomplete addition formulasside-channel countermeasuresmulti-scalar multiplicationunified addition formulas

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over global fields (11G05) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (80)

A theta model for elliptic curves ⋮ A complete set of addition laws for twisted jacobi intersection curves ⋮ Small scalar multiplication on Weierstrass curves using division polynomials ⋮ Formal Proof of the Group Law for Edwards Elliptic Curves ⋮ Further refinements of Miller's algorithm on Edwards curves ⋮ On the linear complexity profile of some sequences derived from elliptic curves ⋮ On the near prime-order MNT curves ⋮ Pairing Computation on Edwards Curves with High-Degree Twists ⋮ Decaf: Eliminating Cofactors Through Point Compression ⋮ Elliptic divisibility sequences over the Edwards model of elliptic curves ⋮ On the number of distinct elliptic curves in some families ⋮ Interrelation of families of points of high order on the Edwards curve over a prime field ⋮ Algorithms for base point generation on an Edwards curve with the use of point divisibility criteria ⋮ Jacobian coordinates on genus 2 curves ⋮ Generalised Mersenne numbers revisited ⋮ The complete cost of cofactor \(h=1\) ⋮ Twisted Hessian Curves ⋮ An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform ⋮ On Near Prime-Order Elliptic Curves with Small Embedding Degrees ⋮ Horizontal collision correlation attack on elliptic curves ⋮ An application of crypto cloud computing in social networks by cooperative game theory ⋮ Recovering secrets from prefix-dependent leakage ⋮ Twisted Edwards Curves ⋮ On isogeny classes of Edwards curves over finite fields ⋮ Isomorphism classes of Edwards curves over finite fields ⋮ An analog of the Edwards model for Jacobians of genus 2 curves ⋮ A note on inverted twisted Edwards curve ⋮ Special properties of the point addition law for non-cyclic Edwards curves ⋮ A formula for disaster: a unified approach to elliptic curve special-point-based attacks ⋮ PQC CSIKE algorithm on non-cyclic Edwards curves ⋮ Faster computation of the Tate pairing ⋮ A complete set of addition laws for incomplete Edwards curves ⋮ Addition law structure of elliptic curves ⋮ Two kinds of division polynomials for twisted Edwards curves ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ On Edwards curves and ZVP-attacks ⋮ Endomorphisms for faster elliptic curve cryptography on a large class of curves ⋮ The pairing computation on Edwards curves ⋮ Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and ℓIC-Derivatives ⋮ Inverted Edwards Coordinates ⋮ Connecting Legendre with Kummer and Edwards ⋮ How to construct CSIDH on Edwards curves ⋮ Using symmetries in the index calculus for elliptic curves discrete logarithm ⋮ Efficient message transmission via twisted Edwards curves ⋮ Arithmetic of Split Kummer Surfaces: Montgomery Endomorphism of Edwards Products ⋮ Group law on affine conics and applications to cryptography ⋮ ECM using Edwards curves ⋮ Number of curves in the generalized Edwards form with minimal even cofactor of the curve order ⋮ Complete addition laws on abelian varieties ⋮ Twisted $${\mu }_4$$ -Normal Form for Elliptic Curves ⋮ A new public key cryptosystem based on Edwards curves ⋮ On Cycles of Pairing-Friendly Elliptic Curves ⋮ Toric forms of elliptic curves and their arithmetic ⋮ Huff’s Model for Elliptic Curves ⋮ Protecting ECC against fault attacks: the ring extension method revisited ⋮ Twisted Edwards Curves Revisited ⋮ Pairing Computation on Twisted Edwards Form Elliptic Curves ⋮ Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace ⋮ Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves ⋮ Supersingular twisted Edwards curves over prime fields. II: Supersingular twisted Edwards curves with the \(j\)-invariant equal to \(66^3\) ⋮ Exact number of elliptic curves in the canonical form, which are isomorphic to Edwards curves over prime field ⋮ Cryptography on twisted Edwards curves over local fields ⋮ Isogenies on twisted Hessian curves ⋮ О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат ⋮ Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication ⋮ Arithmetic of the level four theta model of elliptic curves ⋮ Speeding up Huff form of elliptic curves ⋮ Cryptographic aspects of real hyperelliptic curves ⋮ The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines ⋮ ECM on Graphics Cards ⋮ Double-Base Number System for Multi-scalar Multiplications ⋮ Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves ⋮ Construction of strong elliptic curves suitable for cryptographic applications ⋮ Deterministic Encoding into Twisted Edwards Curves ⋮ Jacobi Quartic Curves Revisited ⋮ Supersingular twisted Edwards curves over prime fields. I: Supersingular twisted Edwards curves with \(j\)-invariants equal to zero and \(12^3\) ⋮ The GPS Identification Scheme Using Frobenius Expansions ⋮ Another Approach to Pairing Computation in Edwards Coordinates ⋮ Bitcoin security with a twisted Edwards curve ⋮ Constructing abelian surfaces for cryptography via Rosenhain invariants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Public key cryptography -- PKC 2006. 9th international conference on theory and practice of public-key cryptography, New York, NY, USA, April 24--26, 2006. Proceedings.
• Applied algebra, algebraic algorithms and error-correcting codes. 15th international symposium, AAECC-15, Toulouse, France, May 12--16, 2003. Proceedings
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Cryptographic hardware and embedded systems -- CHES 2002. 4th international workshop, Redwood Shores, CA, USA, August 13--15, 2002. Revised papers
• Complete systems of two addition laws for elliptic curves
• Advances in cryptology - EUROCRYPT '94. Workshop on the theory and application of cryptographic techniques, Perugia, Italy, May 9-12, 1994. Proceedings
• Selected areas in cryptography. 12th international workshop, SAC 2005, Kingston, ON, Canada, August 11--12, 2005. Revised selected papers.
• The complexity of certain multi-exponentiation techniques in cryptography
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Power Analysis Attacks
• A normal form for elliptic curves
• Accelerated Verification of ECDSA Signatures
• Advances in Elliptic Curve Cryptography
• Cryptography and Coding
• Public Key Cryptography - PKC 2006
• Public Key Cryptography - PKC 2006
• Cryptographic hardware and embedded systems - CHES 2001. 3rd international workshop, Paris, France, May 14--16, 2001. Proceedings

This page was built for publication: Faster Addition and Doubling on Elliptic Curves