Back to Search
Start Over
Point compression for the trace zero subgroup over a small degree extension field
- Source :
- Designs Codes and Cryptography
- Publication Year :
- 2015
-
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.<br />Comment: 23 pages, to appear in Designs, Codes and Cryptography
- Subjects :
- FOS: Computer and information sciences
Pure mathematics
Trace (linear algebra)
Computer Science - Cryptography and Security
Field (mathematics)
0102 computer and information sciences
02 engineering and technology
Scalar multiplication
14G50, 11G25, 14H52, 11T71, 14K15
01 natural sciences
Mathematics - Algebraic Geometry
ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION
0202 electrical engineering, electronic engineering, information engineering
FOS: Mathematics
Algebraic Geometry (math.AG)
Mathematics
Degree (graph theory)
Applied Mathematics
Zero (complex analysis)
020206 networking & telecommunications
Computer Science Applications
Quintic function
Elliptic curve
010201 computation theory & mathematics
Field extension
Cryptography and Security (cs.CR)
Subjects
Details
- Volume :
- 75
- Issue :
- 2
- Database :
- OpenAIRE
- Journal :
- Designs Codes and Cryptography
- Accession number :
- edsair.doi.dedup.....729a84ab603a0720e9de1a8a6671eccd
- Full Text :
- https://doi.org/10.1007/s10623-014-9921-0