scientific article; zbMATH DE number 2219248

zbMATH Open1088.94019MaRDI QIDQ5697933FDOQ5697933

Authors: Ran Tao, Li-Yan Chen 

Publication date: 27 October 2005

Title of this publication is not available (Why is that?)

Recommendations

• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• Improvement of the algorithm of point multiplication on elliptic curves over \(\mathrm{GF}(2^m)\)
• Fast elliptic curve point multiplication based on window non-adjacent form method
• Faster scalar multiplication algorithm based on addition chain
• Publication:4502798

zbMATH Keywords

non-adjacent form (NAF)

Mathematics Subject Classification ID

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

Cited In (20)

• Improved fixed-base comb method for fast scalar multiplication
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast elliptic curve point multiplication based on window non-adjacent form method
• Parallelized Software Implementation of Elliptic Curve Scalar Multiplication
• Speeding up the elliptic curve scalar multiplication using non adjacent form
• Fast simultaneous scalar multiplication
• Title not available (Why is that?)
• A multiple scalar multiplication algorithm in elliptic curve cryptosystems
• Scalar multiplication in elliptic curve libraries
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods
• The soft graphic integer sub-decomposition method for elliptic scalar multiplication
• A method for the efficient computation of scalar multiplication in Koblitz curve
• Efficient scalar multiplication for elliptic curves over binary fields
• An Improved Binary Method for Scalar Multiplication in Elliptic Curve Cryptography
• Faster scalar multiplication algorithm based on addition chain
• Improvement of the algorithm of point multiplication on elliptic curves over \(\mathrm{GF}(2^m)\)

This page was built for publication:

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