Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings

No abstract is available for this paper.

• Publication year

  1998

• Venue

  International Conference on the Theory and Application of Cryptology and Information Security

• Publication date

  1998-10-18

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-49649-1_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Joseph H.Silverman:Advanced Topics in the Arithmetic of Elliptic Curves (書評)

  1997cited by this paper
• Elliptic and modular curves over finite fields and related computational issues

  1997cited by this paper
• Efficient construction of secure hyperelliptic discrete logarithm problems

  1997cited by this paper
• Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance

  1995cited by this paper
• Calcul du nombre de points sur une courbe elliptique dans un corps fini : aspects algorithmiques

  1995cited by this paper
• Counting points on elliptic curves over finite fields

  1995cited by this paper
• Schoof's algorithm and isogeny cycles

  1994cited by this paper
• Constructing elliptic curves with given group order over large finite fields

  1994cited by this paper
• Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks

  1994cited by this paper
• Advanced Topics in the Arithmetic of Elliptic Curves

  1994cited by this paper
• Elliptic curve public key cryptosystems

  1993cited by this paper
• A course in computational algebraic number theory

  1993cited by this paper
• ELLIPTIC CURVES AND PRIMALITY PROVING

  1993cited by this paper
• Building Elliptic Curves Modulo Large Primes

  1991cited by this paper
• Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields by Integer Lattice Reduction

  1991cited by this paper
• Review: Joseph H. Silverman, The arithmetic of elliptic curves

  1987cited by this paper
• Elliptic curve cryptosystems

  1987cited by this paper
• The arithmetic of elliptic curves

  1986cited by this paper
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p

  1985cited by this paper
• Use of Elliptic Curves in Cryptography

  1985cited by this paper
• On singular moduli.

  1984cited by this paper
• Good reduction of abelian varieties

  1968cited by this paper
• Endomorphisms of abelian varieties over finite fields

  1966cited by this paper
• Construction of class fields

  1966cited by this paper

• CONSTRUCTING CURVES WITH COMPLEX MULTIPLICATION USING THE CHINESE REMAINDER

  2018cites this paper
• Principally polarized squares of elliptic curves with field of moduli equal to ℚ

  2018cites this paper
• Constructing Picard curves with complex multiplication using the Chinese remainder theorem

  2018cites this paper
• Spécialité Informatique et Réseaux

  2012cites this paper
• Boolean functions, algebraic curves and complex multiplication

  2012cites this paper
• Accelerating the CM method

  2010cites this paper
• Computing Hilbert class polynomials with the Chinese remainder theorem

  2009cites this paper
• Constructing abelian varieties for pairing-based cryptography

  2008cites this paper
• Computing endomorphism rings of Jacobians of genus 2 curves over finite fields

  2007cites this paper
• The complexity of class polynomial computation via floating point approximations

  2006cites this paper
• Efecto de la expansión del espacio de mensajes sobre la longitud de la información y los tiempos de cifrado y descifrado del protocolo basado en el esquema criptográfico con curvas elípticas (eces)

  2005cites this paper
• Computational aspects of modular forms and elliptic curves

  2005cites this paper
• Computing Modular Polynomials

  2004cites this paper
• COMPLEX MULTIPLICATION TESTS FOR ELLIPTIC CURVES

  2004cites this paper
• Isogeny Volcanoes and the SEA Algorithm

  2002cites this paper
• Action of Modular Correspondences around CM Points

  2002cites this paper
• Algorithmic Number Theory

  2002cites this paper
• Constructing elliptic curves with a given number of points over a finite field

  2001cites this paper
• CONSTRUCTING ELLIPTIC CURVES WITH A KNOWN NUMBER OF POINTS OVER A PRIME FIELD

  2001cites this paper
• Characterization of Elliptic Curve Traces under FR-Reduction

  2000cites this paper