Fast Point Multiplication on Elliptic Curves without Precomputation

DOI10.1007/978-3-540-69499-1_4MaRDI QIDQ3519550zbMATH OpenOpenAlexFDO

Authors 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

binary right-to-left exponentiationelliptic curve arithmeticmixed coordinate systems

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1842492
• scientific article; zbMATH DE number 1612501
• scientific article; zbMATH DE number 2048533
• Improvement of the algorithm of point multiplication on elliptic curves over \(\mathrm{GF}(2^m)\)
• scientific article; zbMATH DE number 1504820

Cites work

• A Survey of Fast Exponentiation Methods
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 1302784 (Why is no real title available?)
• scientific article; zbMATH DE number 1504820 (Why is no real title available?)
• scientific article; zbMATH DE number 1418307 (Why is no real title available?)
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Speeding up the computations on an elliptic curve using addition-subtraction chains
• The doubling attack -- why upwards is better than downwards.

Cited in

(19)

• Speeding up elliptic curve discrete logarithm computations with point halving
• Protecting ECC against fault attacks: the ring extension method revisited
• scientific article; zbMATH DE number 1612501 (Why is no real title available?)
• Improving the Big Mac attack on elliptic curve cryptography
• On the application of Wiener's parallel collision search method to discrete logarithmization on Edwards curves
• Efficient scalar multiplications for elliptic curve cryptosystems using mixed coordinates strategy and direct computations
• scientific article; zbMATH DE number 5670187 (Why is no real title available?)
• Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
• scientific article; zbMATH DE number 1980962 (Why is no real title available?)
• scientific article; zbMATH DE number 2044535 (Why is no real title available?)
• scientific article; zbMATH DE number 2085201 (Why is no real title available?)
• scientific article; zbMATH DE number 2086707 (Why is no real title available?)
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• scientific article; zbMATH DE number 2112354 (Why is no real title available?)
• Elliptic curve cryptography arithmetic in terms of one variable polynomial division
• Small scalar multiplication on Weierstrass curves using division polynomials
• Applied Cryptography and Network Security
• Public Key Cryptography – PKC 2004
• A fast and SPA secure scalar multiplication for elliptic curve cryptography

Describes a project that uses

Uses Software

• EFD

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

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