An optimal representation for the trace zero subgroup

DOI10.1007/S10623-016-0249-9zbMATH Open1432.14027arXiv1405.2733OpenAlexW2963358892MaRDI QIDQ521853FDOQ521853

Authors: Elisa Gorla, Maike Massierer 

Publication date: 12 April 2017

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

Abstract: We give an optimal-size representation for the elements of the trace zero subgroup of the Picard group of an elliptic or hyperelliptic curve of any genus, with respect to a field extension of any prime degree. The representation is via the coefficients of a rational function, and it is compatible with scalar multiplication of points. We provide efficient compression and decompression algorithms, and complement them with implementation results. We discuss in detail the practically relevant cases of small genus and extension degree, and compare with the other known compression methods.

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

Recommendations

• Point compression for the trace zero subgroup over a small degree extension field
• Compression for trace zero points on twisted Edwards curves
• Compression of Tate pairings on elliptic curves
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• scientific article; zbMATH DE number 2155360

zbMATH Keywords

discrete logarithm problempairing-based cryptographyefficient representationelliptic and hyperelliptic curve cryptographypoint compressiontrace zero variety

Mathematics Subject Classification ID

Cryptography (94A60) 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) Arithmetic ground fields for abelian varieties (14K15)

Cites Work

• The Magma algebra system. I: The user language
• Number of Points of Varieties in Finite Fields
• Compression in Finite Fields and Torus-Based Cryptography
• Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
• Title not available (Why is that?)
• Public-key cryptosystems based on cubic finite field extensions
• Title not available (Why is that?)
• Torus-Based Compression by Factor 4 and 6
• Practical Cryptography in High Dimensional Tori
• Advances in Cryptology - CRYPTO 2003
• Formulae for arithmetic on genus 2 hyperelliptic curves
• On the discrete logarithm problem in class groups of curves
• High-speed high-security signatures
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Computing in the Jacobian of a Hyperelliptic Curve
• 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
• Elliptic curves. Number theory and cryptography
• Fast genus 2 arithmetic based on Theta functions
• The Weil pairing, and its efficient calculation
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing pairings using \(x\)-coordinates only
• Using abelian varieties to improve pairing-based cryptography
• Point compression for the trace zero subgroup over a small degree extension field
• An \(L(1/3)\) discrete logarithm algorithm for low degree curves
• Efficient computation of roots in finite fields
• \(\lambda\)-coordinates for binary elliptic curves
• Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps
• Advances in Cryptology – CRYPTO 2004
• 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
• Index calculus in the trace zero variety

Cited In (5)

• Compression for trace zero points on twisted Edwards curves
• A characterization of trace-zero sets realizable by compensation in the SNIEP
• Point compression for the trace zero subgroup over a small degree extension field
• Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
• Title not available (Why is that?)

Uses Software

• Magma

This page was built for publication: An optimal representation for the trace zero subgroup

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