Efficient arithmetic on elliptic curve cryptography

MaRDI QIDQ3610193zbMATH OpenFDO

Authors Jing Zhang, Xiaolong Xin

Publication date 6 March 2009

zbMATH Keywords

elliptic curveKoblitz curvemultiplying points

Mathematics Subject Classification ID

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

Recommendations

• Improvement of the algorithm of point multiplication on elliptic curves over \(\mathrm{GF}(2^m)\)
• Efficient elliptic curve cryptosystems
• scientific article; zbMATH DE number 1107696
• Speeding up the computations of elliptic curves cryptoschemes
• scientific article; zbMATH DE number 1088245

Cited in

(12)

• New fast algorithms for elliptic curve arithmetic in affine coordinates
• Efficient algorithms for speeding up the computations of elliptic curve cryptosystems
• Efficient Arithmetic on Elliptic Curves over Fields of Characteristic Three
• Affine Precomputation with Sole Inversion in Elliptic Curve Cryptography
• scientific article; zbMATH DE number 1088245 (Why is no real title available?)
• scientific article; zbMATH DE number 1962162 (Why is no real title available?)
• scientific article; zbMATH DE number 1504541 (Why is no real title available?)
• Efficient elliptic curve cryptosystems
• scientific article; zbMATH DE number 2160554 (Why is no real title available?)
• scientific article; zbMATH DE number 1839433 (Why is no real title available?)
• A new secure and efficient elliptic curve cryptosystem
• Elliptic curve cryptography arithmetic in terms of one variable polynomial division

This page was built for publication: Efficient arithmetic on elliptic curve cryptography

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