Complete Addition Formulas for Prime Order Elliptic Curves

DOI10.1007/978-3-662-49890-3_16zbMath1385.14001MaRDI QIDQ2820491

Joost Renes, Lejla Batina, Craig Costello

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52)

Related Items (14)

Small scalar multiplication on Weierstrass curves using division polynomials ⋮ The complete cost of cofactor \(h=1\) ⋮ Recovering secrets from prefix-dependent leakage ⋮ Protecting the most significant bits in scalar multiplication algorithms ⋮ Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier ⋮ A formula for disaster: a unified approach to elliptic curve special-point-based attacks ⋮ Differential fault attack on Montgomery ladder and in the presence of scalar randomization ⋮ Differential addition on binary elliptic curves ⋮ Speeding up regular elliptic curve scalar multiplication without precomputation ⋮ Protecting ECC against fault attacks: the ring extension method revisited ⋮ Double-base chains for scalar multiplications on elliptic curves ⋮ Pre-computation scheme of window \(\tau\)NAF for Koblitz curves revisited ⋮ Bitcoin security with a twisted Edwards curve ⋮ Efficient FPGA design of exception-free generic elliptic curve cryptosystems

This page was built for publication: Complete Addition Formulas for Prime Order Elliptic Curves