Co-Z Addition Formulæ and Binary Ladders on Elliptic Curves

DOI10.1007/978-3-642-15031-9_5zbMath1297.94072OpenAlexW2267101561MaRDI QIDQ3583441

Atsuko Miyaji, Marc Joye, Raveen R. Goundar

Publication date: 17 August 2010

Published in: Cryptographic Hardware and Embedded Systems, CHES 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15031-9_5

zbMATH Keywords

elliptic curvesembedded systemsJacobian coordinatesimplementation attacksMeloni's techniqueregular binary ladders

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (3)

Efficient precomputation schemes of \(kP+lQ\) ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ Memory-Constrained Implementations of Elliptic Curve Cryptography in Co-Z Coordinate Representation

This page was built for publication: Co-Z Addition Formulæ and Binary Ladders on Elliptic Curves