Point compression for Koblitz elliptic curves

DOI10.3934/AMC.2011.5.1MaRDI QIDQ534512zbMATH OpenOpenAlexWikidataFDO

Authors Philip N. J. Eagle, Steven D. Galbraith, John B. Ong

Publication date 17 May 2011

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/amc.2011.5.1

zbMATH Keywords

elliptic curve cryptographyKoblitz curvespoint compression

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Public Key Cryptography – PKC 2004
• Optimal bandwidth for elliptic curves defined over \(\text{GF}(2^n)\)
• Efficient arithmetic on Koblitz curves
• scientific article; zbMATH DE number 2085202
• Koblitz curve cryptosystems

Cited in

(7)

• Fast Point Decompression for Standard Elliptic Curves
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• An optimal representation for the trace zero subgroup
• Point compression for the trace zero subgroup over a small degree extension field
• Optimal bandwidth for elliptic curves defined over \(\text{GF}(2^n)\)
• Public Key Cryptography – PKC 2004
• Multiple point compression on elliptic curves

This page was built for publication: Point compression for Koblitz elliptic curves

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