An optimal representation for the trace zero subgroup
From MaRDI portal
(Redirected from Publication:521853)
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.
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
Cites work
- scientific article; zbMATH DE number 1594291 (Why is no real title available?)
- scientific article; zbMATH DE number 176613 (Why is no real title available?)
- scientific article; zbMATH DE number 1024494 (Why is no real title available?)
- scientific article; zbMATH DE number 1942430 (Why is no real title available?)
- scientific article; zbMATH DE number 2042679 (Why is no real title available?)
- scientific article; zbMATH DE number 1748068 (Why is no real title available?)
- scientific article; zbMATH DE number 1759768 (Why is no real title available?)
- scientific article; zbMATH DE number 2155360 (Why is no real title available?)
- scientific article; zbMATH DE number 2085204 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Algorithmic Number Theory
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- Compression in Finite Fields and Torus-Based Cryptography
- Computing in the Jacobian of a Hyperelliptic Curve
- Computing pairings using x-coordinates only
- Constructive and destructive facets of Weil descent on elliptic curves
- Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
- Efficient computation of roots in finite fields
- Elliptic curves. Number theory and cryptography
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps
- Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
- Fast genus 2 arithmetic based on Theta functions
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- High-speed high-security signatures
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Index calculus in the trace zero variety
- Number of Points of Varieties in Finite Fields
- On the discrete logarithm problem in class groups of curves
- Point compression for Koblitz elliptic curves
- Point compression for the trace zero subgroup over a small degree extension field
- Practical Cryptography in High Dimensional Tori
- Public-key cryptosystems based on cubic finite field extensions
- Speeding the Pollard and Elliptic Curve Methods of Factorization
- The Magma algebra system. I: The user language
- The Weil pairing, and its efficient calculation
- Torus-Based Compression by Factor 4 and 6
- Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
- Using abelian varieties to improve pairing-based cryptography
- \(\lambda\)-coordinates for binary elliptic curves
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
- scientific article; zbMATH DE number 2155360 (Why is no real title available?)
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)