Co-Z addition formulæ and binary ladders on elliptic curves. (Extended abstract)

DOI10.1007/978-3-642-15031-9_5MaRDI QIDQ3583441zbMATH OpenOpenAlexFDO

Authors Raveen R. Goundar, Marc Joye, Atsuko Miyaji

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

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

Recommendations

• \(\text{Co}_-Z\) addition on elliptic curves over finite fields \(\mathrm{GF}(2^m)\)
• Faster Addition and Doubling on Elliptic Curves
• Memory-constrained implementations of elliptic curve cryptography in co-\(Z\) coordinate repre\-sentation
• Faster side-channel resistant elliptic curve scalar multiplication
• New fast algorithms for elliptic curve arithmetic in affine coordinates

Cited in

(7)

• \(\text{Co}_-Z\) addition on elliptic curves over finite fields \(\mathrm{GF}(2^m)\)
• Efficient precomputation schemes of \(kP+lQ\)
• Exceptional Procedure Attack on Elliptic Curve Cryptosystems
• Advances in Cryptology - EUROCRYPT 2004
• Compressed Jacobian coordinates for OEF
• Speeding up regular elliptic curve scalar multiplication without precomputation
• Memory-constrained implementations of elliptic curve cryptography in co-\(Z\) coordinate repre\-sentation

This page was built for publication: Co-\(Z\) addition formulæ and binary ladders on elliptic curves. (Extended abstract)

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