Random Euclidean addition chain generation and its application to point multiplication

DOI10.1007/978-3-642-17401-8_18MaRDI QIDQ3058729zbMATH OpenOpenAlexFDO

Authors Fabien Herbaut, Pierre-Yvan Liardet, Nicolas Meloni, Yannick Teglia, Pascal Véron

Publication date 7 December 2010

Published in Progress in Cryptology - INDOCRYPT 2010 (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-00674251/file/rand_eac_ecc.pdf

zbMATH Keywords

elliptic curvesaddition chainexponentiationpoint multiplicationSPA

Mathematics Subject Classification ID

Cryptography (94A60) Other combinatorial number theory (11B75) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• A fast and secure elliptic curve scalar multiplication algorithm based on special addition chains
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
• New Point Addition Formulae for ECC Applications
• scientific article; zbMATH DE number 2085202
• scientific article; zbMATH DE number 2085437

Cited in

(2)

• Efficient self-pairing on ordinary elliptic curves
• New versions of Miller-loop secured against side-channel attacks

Describes a project that uses

Uses Software

• EFD

This page was built for publication: Random Euclidean addition chain generation and its application to point multiplication

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