Fast Point Multiplication on Elliptic Curves without Precomputation

DOI10.1007/978-3-540-69499-1_4zbMath1202.94184OpenAlexW1511956794MaRDI QIDQ3519550

Marc Joye

Publication date: 19 August 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_4

zbMATH Keywords

elliptic curve arithmeticbinary right-to-left exponentiationmixed coordinate systems

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves (14H52) Finite ground fields in algebraic geometry (14G15) Computational aspects of algebraic curves (14Q05)

Related Items (2)

Protecting ECC against fault attacks: the ring extension method revisited ⋮ Improving the Big Mac Attack on Elliptic Curve Cryptography

Uses Software

• EFD

Cites Work

• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• A Survey of Fast Exponentiation Methods
• The Doubling Attack – Why Upwards Is Better than Downwards
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Point Multiplication on Elliptic Curves without Precomputation