Faster and lower memory scalar multiplication on supersingular curves in characteristic three

DOI10.1007/978-3-642-19379-8_7MaRDI QIDQ3084343zbMATH OpenOpenAlexFDO

Authors Clemens Heuberger, Roberto Maria Avanzi

Publication date 15 March 2011

Published in Public Key Cryptography – PKC 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19379-8_7

zbMATH Keywords

supersingular elliptic curvesscalar multiplicationexplicit formulaeFrobenius expansionpairing-friendly elliptic curves

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Computational aspects of algebraic curves (14Q05) Mathematical problems of computer architecture (68M07)

Recommendations

• Progress in Cryptology – Mycrypt 2005
• Efficient algorithms for Koblitz curves over fields of characteristic three
• Extending Scalar Multiplication Using Double Bases
• Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems
• scientific article; zbMATH DE number 1942431

Cited in

(5)

• Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
• Symmetric digit sets for elliptic curve scalar multiplication without precomputation
• Fast vector arithmetic over \(\mathbb{F}_3\)
• Progress in Cryptology – Mycrypt 2005
• A comparison of MNT curves and supersingular curves

This page was built for publication: Faster and lower memory scalar multiplication on supersingular curves in characteristic three

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