Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three

DOI10.1007/978-3-642-19379-8_7zbMath1292.14039OpenAlexW1561702390MaRDI QIDQ3084343

Clemens Heuberger, Roberto M. 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

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

Related Items (1)

Symmetric digit sets for elliptic curve scalar multiplication without precomputation

This page was built for publication: Faster and Lower Memory Scalar Multiplication on Supersingular Curves in Characteristic Three