Faster repeated doublings on binary elliptic curves

DOI10.1007/978-3-662-43414-7_23MaRDI QIDQ2949545zbMATH OpenOpenAlexFDO

Authors Christophe Doche, Daniel Sutantyo

Publication date 1 October 2015

Published in Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-43414-7_23

zbMATH Keywords

elliptic curvespublic key cryptographyscalar multiplication

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2085211
• scientific article; zbMATH DE number 1504820
• Faster Addition and Doubling on Elliptic Curves
• Fast point multiplication algorithms for binary elliptic curves with and without precomputation
• Speeding up regular elliptic curve scalar multiplication without precomputation

Cited in

(2)

• How to (pre-)compute a ladder -- improving the performance of X25519 and X448
• A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms

Describes a project that uses

Uses Software

• NTL
• gmp
• EFD

This page was built for publication: Faster repeated doublings on binary elliptic curves

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