A heuristic method of scalar multiplication of elliptic curve over OEF

MaRDI QIDQ849927zbMATH OpenFDO

Authors Duo Liu, Ping Luo, Yiqi Dai

Publication date 15 November 2006

Published in Journal of Shanghai Jiaotong University (Science) (Search for Journal in Brave)

zbMATH Keywords

cryptologyFrobeniusoptimal extension field

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Computational aspects of algebraic curves (14Q05)

Recommendations

• scientific article; zbMATH DE number 7120855
• Efficient scalar multiplication for elliptic curves over binary fields
• An Improved Binary Method for Scalar Multiplication in Elliptic Curve Cryptography
• Fast scalar multiplication for elliptic curves over binary fields by efficiently computable formulas
• Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplication
• Efficient scalar multiplications for elliptic curve cryptosystems using mixed coordinates strategy and direct computations
• scientific article; zbMATH DE number 1612501
• A \(w\)-NNAF method for the efficient computation of scalar multiplication in elliptic curve cryptography
• A multiple scalar multiplication algorithm in elliptic curve cryptosystems

This page was built for publication: A heuristic method of scalar multiplication of elliptic curve over OEF

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