Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography

DOI10.1007/978-3-540-73458-1_19MaRDI QIDQ3608921zbMATH OpenOpenAlexFDO

Authors Erik Dahmen, Katsuyuki Okeya, Daniel Schepers

Publication date 6 March 2009

Published in Information Security and Privacy (Search for Journal in Brave)

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

zbMATH Keywords

affine coordinateselliptic curve cryptosystemprecomputationscalar multiplication

Mathematics Subject Classification ID

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

Recommendations

• Trading inversions for multiplications in elliptic curve cryptography
• New fast algorithms for elliptic curve arithmetic in affine coordinates
• Efficient arithmetic on elliptic curve cryptography
• Improved precomputation scheme for scalar multiplication on elliptic curves
• Fixed argument pairing inversion on elliptic curves
• Algebraic precomputations in differential and integral cryptanalysis
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• scientific article; zbMATH DE number 1839433
• Symmetric digit sets for elliptic curve scalar multiplication without precomputation

Cited in

(7)

• Improved precomputation scheme for scalar multiplication on elliptic curves
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Efficient precomputation schemes of \(kP+lQ\)
• scientific article; zbMATH DE number 1979310 (Why is no real title available?)
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• Divisor class group arithmetic on \(C_{3,4}\) curves

This page was built for publication: Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography

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