Random Euclidean Addition Chain Generation and Its Application to Point Multiplication

DOI10.1007/978-3-642-17401-8_18zbMath1294.94051OpenAlexW1485954220MaRDI QIDQ3058729

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

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 curvesexponentiationaddition chainpoint multiplicationSPA

Mathematics Subject Classification ID

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

Related Items (2)

New versions of Miller-loop secured against side-channel attacks ⋮ Efficient Self-pairing on Ordinary Elliptic Curves

Uses Software

• EFD

This page was built for publication: Random Euclidean Addition Chain Generation and Its Application to Point Multiplication