Point compression for the trace zero subgroup over a small degree extension field
From MaRDI portal
Publication:2340180
Abstract: Using Semaev's summation polynomials, we derive a new equation for the -rational points of the trace zero variety of an elliptic curve defined over . 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.
Recommendations
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 1842492 (Why is no real title available?)
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
- Advances in Cryptology - CRYPTO 2003
- Algorithmic Number Theory
- Algorithmic Number Theory
- Computing pairings using x-coordinates only
- Constructive and destructive facets of Weil descent on elliptic curves
- Discrete logarithm in \(\mathrm{GF}(2^{809})\) with FFS
- Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
- Elliptic curve discrete logarithm problem over small degree extension fields
- Endomorphisms for faster elliptic curve cryptography on a large class of curves
- Four-dimensional Gallant-Lambert-Vanstone scalar multiplication
- High-speed high-security signatures
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Modern computer algebra
- On the Discrete Logarithm Problem on Algebraic Tori
- 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}}\)
- Point compression for Koblitz elliptic curves
- Public-key cryptosystems based on cubic finite field extensions
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- The Magma algebra system. I: The user language
- 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
(4)
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)