Point compression for the trace zero subgroup over a small degree extension field

DOI10.1007/S10623-014-9921-0zbMATH Open1319.14033arXiv1403.0126OpenAlexW3104884073MaRDI QIDQ2340180FDOQ2340180

Authors: Elisa Gorla, Maike Massierer 

Publication date: 16 April 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Using Semaev's summation polynomials, we derive a new equation for the $mathbb{F}_q$-rational points of the trace zero variety of an elliptic curve defined over $mathbb{F}_q$. Using this equation, we produce an optimal-size representation for such points. Our representation is compatible with scalar multiplication. We give a point compression algorithm to compute the representation and a decompression algorithm to recover the original point (up to some small ambiguity). The algorithms are efficient for trace zero varieties coming from small degree extension fields. We give explicit equations and discuss in detail the practically relevant cases of cubic and quintic field extensions.

Full work available at URL: https://arxiv.org/abs/1403.0126

Recommendations

• An optimal representation for the trace zero subgroup
• Compression for trace zero points on twisted Edwards curves
• Multiple point compression on elliptic curves
• scientific article; zbMATH DE number 2155360
• Public Key Cryptography – PKC 2004

zbMATH Keywords

elliptic curvespoint compressiontrace zero varietysummation polynomialsdiscrete logarithm problem, elliptic curve cryptography

Mathematics Subject Classification ID

Varieties over finite and local fields (11G25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52)

Cites Work

• The Magma algebra system. I: The user language
• On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
• A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
• Title not available (Why is that?)
• Public-key cryptosystems based on cubic finite field extensions
• Title not available (Why is that?)
• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
• Advances in Cryptology - CRYPTO 2003
• High-speed high-security signatures
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Title not available (Why is that?)
• Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
• Modern computer algebra
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructive and destructive facets of Weil descent on elliptic curves
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Elliptic curve discrete logarithm problem over small degree extension fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic Number Theory
• Title not available (Why is that?)
• Computing pairings using \(x\)-coordinates only
• Using abelian varieties to improve pairing-based cryptography
• \(\lambda\)-coordinates for binary elliptic curves
• Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
• Title not available (Why is that?)
• Point compression for Koblitz elliptic curves
• Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
• Algorithmic Number Theory
• On the Discrete Logarithm Problem on Algebraic Tori
• Solving a $$6120$$ -bit DLP on a Desktop Computer
• Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS

Cited In (4)

• Index calculus in the trace zero variety
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• An optimal representation for the trace zero subgroup
• Faster point compression for elliptic curves of \(j\)-invariant 0

Uses Software

• Magma

This page was built for publication: Point compression for the trace zero subgroup over a small degree extension field

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