An optimal representation for the trace zero subgroup

DOI10.1007/s10623-016-0249-9zbMath1432.14027arXiv1405.2733OpenAlexW2963358892MaRDI QIDQ521853

Maike Massierer, Elisa Gorla

Publication date: 12 April 2017

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Arithmetic ground fields for abelian varieties (14K15) Varieties over finite and local fields (11G25) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Uses Software

• Magma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Point compression for Koblitz elliptic curves
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Index calculus in the trace zero variety
• Computing pairings using \(x\)-coordinates only
• Using abelian varieties to improve pairing-based cryptography
• The Magma algebra system. I: The user language
• Constructive and destructive facets of Weil descent on elliptic curves
• The Weil pairing, and its efficient calculation
• Formulae for arithmetic on genus 2 hyperelliptic curves
• 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
• On the discrete logarithm problem in class groups of curves
• High-Speed High-Security Signatures
• Compression in Finite Fields and Torus-Based Cryptography
• Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
• Factor-4 and 6 compression of cyclotomic subgroups of and
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Computing in the Jacobian of a Hyperelliptic Curve
• Public-key cryptosystems based on cubic finite field extensions
• Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication
• Factor-4 and 6 (De)Compression for Values of Pairings Using Trace Maps
• Torus-Based Compression by Factor 4 and 6
• Advances in Cryptology – CRYPTO 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Practical Cryptography in High Dimensional Tori
• Efficient and Secure Algorithms for GLV-Based Scalar Multiplication and Their Implementation on GLV-GLS Curves
• Advances in Cryptology - CRYPTO 2003
• Fast genus 2 arithmetic based on Theta functions
• Algorithmic Number Theory
• Number of Points of Varieties in Finite Fields

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