Efficiently computable complex multiplication of elliptic curves

DOI10.1007/978-3-031-26553-2_16zbMATH Open1519.94165OpenAlexW4321353924MaRDI QIDQ6134027FDOQ6134027

Authors Xiao Li, Wei Yu, Yuqing Zhu, Zhizhong Pan

Publication date 21 August 2023

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

Full work available at URL https://doi.org/10.1007/978-3-031-26553-2_16

zbMATH Keywords

complex multiplicationelliptic curvesexplicit expressionGLV method

Mathematics Subject Classification ID

Cryptography (94A60) Elliptic curves over local fields (11G07)

Recommendations

• Computation on elliptic curves with complex multiplication
• scientific article; zbMATH DE number 1583945
• The complexity of class polynomial computation via floating point approximations
• Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves
• Endomorphisms for faster elliptic curve cryptography on a large class of curves

Cites work

• scientific article; zbMATH DE number 706265 (Why is no real title available?)
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• scientific article; zbMATH DE number 3409454 (Why is no real title available?)
• Counting points on elliptic curves over finite fields
• Elliptic curves. Number theory and cryptography
• The Arithmetic of Elliptic Curves
• The \(\mathbb Q\)-curve construction for endomorphism-accelerated elliptic curves

Cited in

(4)

• Complex multiplication structure of elliptic curves
• scientific article; zbMATH DE number 1116612 (Why is no real title available?)
• scientific article; zbMATH DE number 1860729 (Why is no real title available?)
• Efficient computation of pairings on Jacobi quartic elliptic curves

This page was built for publication: Efficiently computable complex multiplication of elliptic curves

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