New Point Addition Formulae for ECC Applications

DOI10.1007/978-3-540-73074-3_15zbMath1236.94062OpenAlexW1523814493MaRDI QIDQ5426090

Nicolas Meloni

Publication date: 15 November 2007

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73074-3_15

zbMATH Keywords

Fibonaccielliptic curveexponentiationscalar multiplicationaddition chains

Mathematics Subject Classification ID

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

Related Items (8)

Small scalar multiplication on Weierstrass curves using division polynomials ⋮ Jacobian coordinates on genus 2 curves ⋮ A formula for disaster: a unified approach to elliptic curve special-point-based attacks ⋮ New versions of Miller-loop secured against side-channel attacks ⋮ 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 ⋮ Improved Precomputation Scheme for Scalar Multiplication on Elliptic Curves

This page was built for publication: New Point Addition Formulae for ECC Applications