Trading inversions for multiplications in elliptic curve cryptography

DOI10.1007/S10623-005-3299-YMaRDI QIDQ2491297zbMATH OpenOpenAlexWikidataFDO

Authors Mathieu Ciet, Marc Joye, Peter L. Montgomery, Kristin Lauter

Publication date 29 May 2006

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-005-3299-y

zbMATH Keywords

affine coordinatescryptographyelliptic curvesfast arithmetic

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52) Cryptography (94A60)

Recommendations

• New fast algorithms for elliptic curve arithmetic in affine coordinates
• Efficient scalar multiplication for elliptic curves over binary fields
• Three dimensional Montgomery ladder, differential point tripling on Montgomery curves and point quintupling on weierstrass' and Edwards curves
• Analysis and optimization of elliptic-curve single-scalar multiplication
• Speeding up regular elliptic curve scalar multiplication without precomputation

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Survey of Fast Exponentiation Methods
• New directions in cryptography
• The Montgomery inverse and its applications

Cited in

(23)

• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• Double-base chains for scalar multiplications on elliptic curves
• Speeding-up verification of digital signatures
• Fast elliptic curve point multiplication based on window non-adjacent form method
• A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography
• Analysis on Yu et al.'s dynamic algorithm for canonic DBC
• Three dimensional Montgomery ladder, differential point tripling on Montgomery curves and point quintupling on weierstrass' and Edwards curves
• Group law computations on Jacobians of hyperelliptic curves
• Improved precomputation scheme for scalar multiplication on elliptic curves
• A Tree-Based Approach for Computing Double-Base Chains
• Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography
• Double-Base Number System for Multi-scalar Multiplications
• Analysis and optimization of elliptic-curve single-scalar multiplication
• Point multiplication on elliptic curves over finite fields using many-base number systems and new types of coordinates
• Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis
• The double-base number system and its application to elliptic curve cryptography
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
• A Graph Theoretic Analysis of Double Base Number Systems
• Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System
• A fast and SPA secure scalar multiplication for elliptic curve cryptography
• Fast elliptic scalar multiplication using new double-base chain and point halving
• Efficient Tate pairing computation using double-base chains

This page was built for publication: Trading inversions for multiplications in elliptic curve cryptography

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