Analysis of the Weil Descent Attack of Gaudry, Hess and Smart

No abstract is available for this paper.

• Publication year

  2001

• Venue

  The Cryptographer's Track at RSA Conference

• Publication date

  2001-04-08

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-45353-9_23
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Constructive and destructive facets of Weil descent on elliptic curves

  2002influential reference
• A general framework for subexponential discrete logarithm algorithms

  2002cited by this paper
• The Extended Euclidian Algorithm on Polynomials, and the Computational Efficiency of Hyperelliptic Cryptosystems

  2001cited by this paper
• Applications of Arithmetical Geometry to Cryptographic Constructions

  2001cited by this paper
• Polynomial Reconstruction Based Cryptography

  2001cited by this paper
• Efficient Arithmetic on Koblitz Curves

  2000cited by this paper
• An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves

  2000cited by this paper
• Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings

  2000cited by this paper
• A Cryptographic Application of Weil Descent

  1999cited by this paper
• The Discrete Logarithm Problem on Elliptic Curves of Trace One

  1999cited by this paper
• Faster Attacks on Elliptic Curve Cryptosystems

  1998cited by this paper
• Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p

  1998cited by this paper
• Comparing Real and Imaginary Arithmetics for Divisor Class Groups of Hyperelliptic Curves

  1998influential reference
• Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves

  1998cited by this paper
• Algorithmic number theory

  1996cited by this paper
• A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves

  1994cited by this paper
• A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields

  1994cited by this paper
• Advances in Cryptology-Crypto 91

  1992cited by this paper
• CM-Curves with Good Cryptographic Properties

  1991cited by this paper
• Reducing elliptic curve logarithms to logarithms in a finite field

  1991cited by this paper
• Codes and cryptography

  1988cited by this paper
• Computing in the Jacobian of a hyperelliptic curve

  1987cited by this paper
• An Improved Algorithm for Computing Logarithms over GP(p) and Its Cryptographic Significance

  1978cited by this paper
• Monte Carlo methods for index computation ()

  1978influential reference

• The Influence of Public-Key Cryptography on Mathematics

  2022cites this paper
• Extending the GLS endomorphism to speed up GHS Weil descent using Magma

  2021cites this paper
• Computing Discrete Logarithms

  2021cites this paper
• University of Birmingham On index calculus algorithms for subfield curves

  2020cites this paper
• On Index Calculus Algorithms for Subfield Curves

  2020cites this paper
• Binary Kummer Line

  2019cites this paper
• Constant-time hardware computation of elliptic curve scalar multiplication around the 128 bit security level

  2018cites this paper
• Koblitz Curves over Quadratic Fields

  2018cites this paper
• A Note on the Kernel of Group Homomorphism from the Weil Descent Method

  2017cites this paper
• A Note on the Kernel of Group Homomorphism from the Weil Descent Method

  2017influential citation
• The Montgomery ladder on binary elliptic curves

  2017cites this paper
• Design and implementation of a constant-time FPGA accelerator for fast elliptic curve cryptography

  2016cites this paper
• On the effectiveness of isogeny walks for extending cover attacks on elliptic curves

  2016cites this paper
• Software Implementation of Koblitz Curves over Quadratic Fields

  2016cites this paper
• A classification of elliptic curves with respect to the GHS attack in odd characteristic

  2015cites this paper
• Attacking a Binary GLS Elliptic Curve with Magma

  2015cites this paper
• Introduction to Cryptography

  2015cites this paper
• Recent progress on the elliptic curve discrete logarithm problem

  2015cites this paper
• An area-efficient composite field inverter for elliptic curve cryptosystems

  2014cites this paper
• Classification of Elliptic/hyperelliptic Curves with Weak Coverings against GHS Attack under an Isogeny Condition

  2013cites this paper
• VLSI implementation and its optimisation for digital cryptosystems

  2012cites this paper
• Compact Multiplicative Inverter for Hardware Elliptic Curve Cryptosystem

  2012cites this paper
• Elliptic Curve Cryptography: The Serpentine Course of a Paradigm Shift

  2011cites this paper
• Authenticated Key Agreement Protocols: Security Models, Analyses, and Designs. (Protocoles d'échanges de clefs authentifiés : modèles de sécurité, analyses et constructions)

  2010cites this paper
• Classification of Elliptic/hyperelliptic Curves with Weak Coverings against GHS Attack without Isogeny Condition

  2009cites this paper
• Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristics

  2009cites this paper
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem

  2009cites this paper
• Analyzing the Galbraith-Lin-Scott Point Multiplication Method for Elliptic Curves over Binary Fields

  2009cites this paper
• Batch Binary Edwards

  2009cites this paper
• Algorithmique des courbes algébriques pour la cryptologie

  2008cites this paper
• Public-Key Cryptography for RFID Tags and Applications

  2008cites this paper
• Using Elliptic Curves on RFID Tags

  2008cites this paper
• Development of a competition model for a cryptosystem based on the analytical hierarchic process

  2008cites this paper
• The HECTOR BAT

  2008cites this paper
• On general multi-quadratic function field extensions in the GHS attack

  2008cites this paper
• On Implementation of GHS Attack against Elliptic Curve Cryptosystems over Cubic Extension Fields of Odd Characteristics

  2008cites this paper
• The use of elliptic curves in cryptography

  2007influential citation
• An Elliptic Curve Processor Suitable For RFID-Tags

  2006cites this paper
• Soft-Timeout Distributed Key Generation for Digital Signature based on Elliptic Curve D-log for Low-Power Devices

  2005cites this paper
• Algebraic curves and cryptography

  2005cites this paper
• Advances in Elliptic Curve Cryptography: Cryptography from Pairings

  2005cites this paper
• Scholten Forms and Elliptic/Hyperelliptic Curves with Weak Weil Restrictions

  2005cites this paper
• Ordinary elliptic curves of high rank over F p (x) with constant j-invariant II

  2005cites this paper
• Koblitz curve cryptosystems

  2005cites this paper
• Redundant Trinomials for Finite Fields of Characteristic 2

  2005cites this paper
• Cryptographic implications of Hess' generalized GHS attack

  2005cites this paper
• An Extension of GHS Weil Descent Attack

  2005cites this paper
• Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults

  2005cites this paper
• Advances in Elliptic Curve Cryptography: Weil Descent Attacks

  2005influential citation
• On Security of Superelliptic Curves Based Cryptosystems against GHS Weil Descent Attacks

  2005cites this paper
• Elliptic Curve Discrete Logarithm Problem

  2005cites this paper
• Weak Fields for ECC

  2004cites this paper
• Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

  2004cites this paper
• Index calculus for abelian varieties and the elliptic curve discrete logarithm problem

  2004cites this paper
• An Extension of GHS Weil Descent Attack ∗

  2004cites this paper
• A Survey of Public-Key Cryptosystems

  2004cites this paper
• Hyperelliptic Curves and Cryptography

  2004cites this paper
• An Elliptic Curve Trapdoor System

  2004influential citation
• On Randomized Addition-Subtraction Chains to Counteract Differential Power Attacks

  2004cites this paper
• Improved Scalar Multiplication on Elliptic Curves Defined over F2mn

  2004cites this paper
• Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem

  2004cites this paper
• Ordinary elliptic curves of high rank over with constant j-invariant

  2004cites this paper
• Guide to Elliptic Curve Cryptography

  2004cites this paper
• Weil Descent Attack for Artin-Schreier Curves

  2003cites this paper
• Ordinary elliptic curves of high rank over $\bar F_p(x)$ with constant j-invariant

  2003cites this paper
• The GHS Attack Revisited

  2003cites this paper
• Attacks A report for the AREHCC project

  2003cites this paper
• Explicit machine computation and programs ( not the theory of computation or programming

  2003cites this paper
• A Report for the Arehcc Project

  2003cites this paper
• Weil descent attack for Kummer extensions

  2003cites this paper
• EVALUATION REPORT FOR CRYPTREC: SECURITY LEVEL OF CRYPTOGRAPHY – ECDLP MATHEMATICAL PROBLEM

  2002cites this paper
• Speeding Up Point Multiplication on Hyperelliptic Curves with Efficiently-Computable Endomorphisms

  2002cites this paper
• Extending the GHS Weil Descent Attack

  2002cites this paper
• Elliptic Curves : The state of the art

  2002cites this paper
• Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent

  2001cites this paper
• The Elliptic Curve Digital Signature Algorithm (ECDSA)

  2001cites this paper
• A Secure Family of Composite Finite Fields Suitable for Fast Implementation of Elliptic Curve Cryptography

  2001influential citation
• Evaluation of Security Level of Cryptography: MY-ELLTY Signature Scheme

  2001cites this paper
• How Secure Are Elliptic Curves over Composite Extension Fields?

  2001cites this paper
• Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree

  2001influential citation
• Evaluation of Security Level of Cryptography: The Elliptic Curve Discrete Logarithm Problem (ECDLP)

  2001cites this paper
• ECDKG : A Distributed Key Generation Protocol Based on Elliptic Curve Discrete Logarithm

  year unknowncites this paper