Constructing elliptic curves with given group order over large finite fields

No abstract is available for this paper.

• Publication year

  1994

• Venue

  International Workshop on Ant Colony Optimization and Swarm Intelligence

• Publication date

  1994-05-06

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-58691-1_64
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Isomorphism Classes of Elliptic Curves Over Finite Fields

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

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

  1991cited by this paper
• Building Elliptic Curves Modulo Large Primes.

  1991cited by this paper
• Courbes elliptiques et tests de primalité

  1990cited by this paper
• Implementation of the Atkin-Goldwasser-Kilian primality testing algorithm

  1988cited by this paper
• Almost all primes can be quickly certified

  1986cited by this paper
• Introduction to the construction of class fields

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

  1985cited by this paper
• Die Klassenkörper der komplexen Multiplikation

  1958cited by this paper
• Die Typen der Multiplikatorenringe elliptischer Funktionenkörper

  1941cited by this paper
• Abstrakte begründung der komplexen multiplikation und riemannsche vermutung in funktionenkörpern

  1934cited by this paper
• Beweis des Analogons der Riemannschen Vermutung für die Artinschen und F. K. Schmidtschen Kongruenzzetafunktionen in gewissen elliptischen Fällen. Vorläufie Mitteilung

  1933cited by this paper
• Lehrbuch der algebra

  year unknowncited by this paper

• Bandersnatch: a fast elliptic curve built over the BLS12-381 scalar field

  2024cites this paper
• Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves

  2022cites this paper
• ON DISCRIMINANTS OF MINIMAL POLYNOMIALS OF THE RAMANUJAN $t_n$ CLASS INVARIANTS

  2022cites this paper
• CETUS: Towards Proportional Capacity Provisioning and Cost-Effectiveness in Frontend Servers

  2020cites this paper
• Extension of elliptic curves on Krasner hyperfields

  2019cites this paper
• IEEE Computer Society

  2019cites this paper
• A Candidate Group with Infeasible Inversion

  2018cites this paper
• Hard Isogeny Problems over RSA Moduli and Groups with Infeasible Inversion

  2018cites this paper
• Cryptography for Security in IoT

  2018cites this paper
• Constructing Elliptic Curves for the GLV Method with Low-cost Decomposition

  2017cites this paper
• Sécurisation des algorithmes de couplages contre les attaques physiques. (Security of pairing algorithms against physical attacks)

  2017cites this paper
• Evolutionary Cryptography Theory-Based Generating Method for Secure ECs

  2017cites this paper
• Elliptic Curve Cryptosystems

  2016cites this paper
• A Survey of Latest Trends in Cryptography and Elliptic Curve Cryptography

  2016cites this paper
• Degenerate Curve Attacks - Extending Invalid Curve Attacks to Edwards Curves and Other Models

  2016cites this paper
• Efficiency evaluation of different types of cryptography curves on low-power devices

  2015cites this paper
• Karatsuba-Block-Comb technique for elliptic curve cryptography over binary fields

  2015cites this paper
• High Speed FPGA Based Elliptic Curve Cryptography Using Mixed Co-ordinates

  2014cites this paper
• CONSTRUCTING ELLIPTIC CURVES WITH A SUBGROUP OF A GIVEN ORDER AND WITH A GIVEN ENDOMORPHISM RING

  2014cites this paper
• An Improved Privacy Preserving Construction for Data Integrity Verification in Cloud Storage

  2014cites this paper
• Constructing Elliptic Curves over Ramanujan's Class Invariants

  2014cites this paper
• Prime order elliptic curve generation methods: A review

  2013cites this paper
• Implementation of Embedded Mobile Device Elliptic Curve Algorithm Fast Generating Algorithm

  2013cites this paper
• An Improved Algorithm of Elliptic Curve Cryptograph

  2013cites this paper
• Fast Elliptic Curve Algorithm of Embedded Mobile Equipment

  2013cites this paper
• An Elliptic Curve Cryptography approach for Digital Signature in PDA devices

  2013cites this paper
• FPGA IMPLEMENTATIONS OF HIGH SPEED ELLIPTIC CURVE CRYPTOGRAPHY: A SURVEY

  2012cites this paper
• Elliptic curve for data protection

  2011cites this paper
• Lower Bounds for Interpolating Polynomials for Square Roots of the Elliptic Curve Discrete Logarithm

  2011influential citation
• Some remarks on the construction of class polynomials

  2011cites this paper
• Topic In Elliptic Curves Over Finite Fields: The Groups of Points

  2011cites this paper
• Method for constructing elliptic curves using complex multiplication and its optimizations

  2011cites this paper
• Smart card implementation of a digital signature scheme for Twisted Edwards curves

  2011cites this paper
• Pairing-Friendly Elliptic Curves With Various Discriminants

  2010cites this paper
• Ramanujan's class invariants and their use in elliptic curve cryptography

  2010cites this paper
• On the Efficient Generation of Prime-Order Elliptic Curves

  2010influential citation
• Efficient implementation of elliptic curve cryptography in wireless sensors

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

  2009cites this paper
• Honor Among Thieves — A Source Coding Based Sharing Mechanism for the BitThief Client

  2008cites this paper
• Introducing Ramanujan's Class Polynomials in the Generation of Prime Order Elliptic Curves

  2008cites this paper
• Construction of Pairing-Friendly Elliptic Curves

  2007influential citation
• The order elliptic curves over finite fields of characteristic two using the Schoof algorithm

  2007cites this paper
• Efficient CM-constructions of elliptic curves over finite fields

  2007cites this paper
• Finite fields of low characteristic in elliptic curve cryptography

  2007cites this paper
• Constructing elliptic curves of prime order

  2007cites this paper
• Ëëôôööøøòò ××óò Aeaeßààððññò Öóñ Aeaeßààððññò Ò Öýôøóóööôôô Öóùô× Áò×øøøùø Ùö Üôööññòøøððð Ååøøøññøøø Íòòúö××øø Ø À ×××ò Ðððöò×øöö××× ¾¾ ¿¾¾ ×××ò Öññòý

  2007cites this paper
• Efficient cryptographic tools for secure distributed computing

  2006cites this paper
• Constructing elliptic curves over finite fields using complex multiplication

  2006cites this paper
• Aspekte der Kryptographie Florian Heß

  2006cites this paper
• Efficient generation of secure elliptic curves

  2006influential citation
• Spreading Alerts Quietly and the Subgroup Escape Problem

  2005cites this paper
• Constructing elliptic curves in almost polynomial time

  2005cites this paper
• Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields

  2005cites this paper
• Pairing-Friendly Elliptic Curves of Prime Order

  2005cites this paper
• Guide to Elliptic Curve Cryptography

  2004cites this paper
• Evaluating elliptic curve based KEMs in the light of pairings

  2004cites this paper
• An efficient threshold group signature scheme

  2004cites this paper
• THE SEA ALGORITHM IN CHARACTERISTIC 2

  2004cites this paper
• On the Use of Weber Polynomials in Elliptic Curve Cryptography

  2004influential citation
• Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations

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

  2004cites this paper
• Design and analysis of semántically secure public key encryption schemes

  2004cites this paper
• Constructing elliptic curves over finite fields using double eta-quotients

  2004cites this paper
• Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups

  2003cites this paper
• Elliptic curve cryptography for lightweight applications

  2003cites this paper
• On the Construction of Prime Order Elliptic Curves

  2003influential citation
• A Fast {Java} Implementation of a Provably Secure Pseudo Random Bit Generator Based on the Elliptic Curve Discrete Logarithm Problem

  2003cites this paper
• A Survey of Elliptic Curve Cryptosystems, Part I: Introductory

  2003cites this paper
• Efficient algorithms for generating elliptic curves over finite fields suitable for use in cryptography

  2002influential citation
• An Improved Method of Multiplication on Certain Elliptic Curves

  2002cites this paper
• Constructing Elliptic Curves with Prescribed Embedding Degrees

  2002cites this paper
• Evaluation of Security Level of Cryptography: The Elliptic Curve Discrete Logarithm Problem (ECDLP)

  2001cites this paper
• Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography

  2001cites this paper
• Cryptographic Hardware and Embedded Systems — CHES 2001

  2001influential citation
• The Elliptic Curve Digital Signature Algorithm (ECDSA)

  2001cites this paper
• Generating Elliptic Curves of Prime Order

  2001cites this paper
• Efficient Computation of Singular Moduli with Application in Cryptography

  2001cites this paper
• Advances in Cryptology — CRYPTO ’96

  2001cites this paper
• The State of Elliptic Curve Cryptography

  2000cites this paper
• A One Round Protocol for Tripartite Diffie–Hellman

  2000cites this paper
• Algorithmique des courbes hyperelliptiques et applications à la cryptologie

  2000cites this paper
• The Diffie–Hellman Protocol

  2000cites this paper
• The Probability that the Number of Points on an Elliptic Curve over a Finite Field is Prime

  2000cites this paper
• Efficient Construction of Cryptographically Strong Elliptic Curves

  2000cites this paper
• The zheng-seberry public key cryptosystem and signcryption

  2000cites this paper
• IEEE Standard Specifications for

  2000cites this paper
• E(cid:14)cient Implementation of Schoof’s Algorithm

  2000cites this paper
• The Relationship Between Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms

  1999cites this paper
• Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic

  1999cites this paper
• Elliptic Curves over Finite Fields

  1999cites this paper
• Elliptic curve cryptosystem development and design

  1999cites this paper
• Ecient Implementation of Schoof's Algorithm

  1999cites this paper
• The Di e-Hellman Protocol

  1999cites this paper
• Constructing Isogenies between Elliptic Curves Over Finite Fields

  1999cites this paper
• Elliptic Curves and Their Applications to Cryptography

  1999cites this paper
• The Elliptic Curve Digital Signature Algorithm ( ECDSA ) 1 2

  1999cites this paper
• ECC: Do We Need to Count?

  1999cites this paper
• SEC 1: Elliptic Curve Cryptography

  1999cites this paper
• Efficient Implementation of Schoof's Algorithm

  1998cites this paper
• Construction of Secure Elliptic Cryptosystems Using CM Tests and Liftings

  1998cites this paper