Improvement of the algorithm of point multiplication on elliptic curves over GF(2ᵐ)

MaRDI QIDQ5492238zbMATH OpenFDO

Authors Maosheng Fu, Zhengfeng Hou, Wei Liu

Publication date 13 October 2006

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2219248
• Fast elliptic curve point multiplication based on window non-adjacent form method
• scientific article; zbMATH DE number 1504820
• Faster scalar multiplication algorithm based on addition chain
• scientific article; zbMATH DE number 1842492

Cited in

(11)

• Fast elliptic curve point multiplication based on window non-adjacent form method
• scientific article; zbMATH DE number 5845550 (Why is no real title available?)
• Faster scalar multiplication algorithm based on addition chain
• Fast Point Multiplication on Elliptic Curves without Precomputation
• scientific article; zbMATH DE number 5733694 (Why is no real title available?)
• Efficient arithmetic on elliptic curve cryptography
• scientific article; zbMATH DE number 1990806 (Why is no real title available?)
• scientific article; zbMATH DE number 2085201 (Why is no real title available?)
• A New Double Point Multiplication Algorithm and Its Application to Binary Elliptic Curves with Endomorphisms
• scientific article; zbMATH DE number 2219248 (Why is no real title available?)
• Cryptology and Network Security

This page was built for publication: Improvement of the algorithm of point multiplication on elliptic curves over \(\mathrm{GF}(2^m)\)

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