Trading inversions for multiplications in elliptic curve cryptography

DOI10.1007/S10623-005-3299-YzbMath1116.14026OpenAlexW2066709282WikidataQ114226860 ScholiaQ114226860MaRDI QIDQ2491297

Mathieu Ciet, Marc Joye, Peter L. Montgomery, Kristin E. 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

elliptic curvescryptographyfast arithmeticaffine coordinates

Mathematics Subject Classification ID

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

Related Items (20)

Group Law Computations on Jacobians of Hyperelliptic Curves ⋮ Fast elliptic scalar multiplication using new double-base chain and point halving ⋮ Analysis on Yu et al.'s dynamic algorithm for canonic DBC ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ A Tree-Based Approach for Computing Double-Base Chains ⋮ Speeding-up verification of digital signatures ⋮ Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis ⋮ Efficient Tate pairing computation using double-base chains ⋮ 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 fast and SPA secure scalar multiplication for elliptic curve cryptography ⋮ О вычислении кратных точек на эллиптических кривых над конечными полями с использованием нескольких оснований систем счисления и новых видов координат ⋮ A Graph Theoretic Analysis of Double Base Number Systems ⋮ Efficient Window-Based Scalar Multiplication on Elliptic Curves Using Double-Base Number System ⋮ Double-Base Number System for Multi-scalar Multiplications ⋮ Double-base chains for scalar multiplications on elliptic curves ⋮ Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves ⋮ A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method

Cites Work

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

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