Generating More MNT Elliptic Curves
Explore this paper's citation graph
Summary
An alternative derivation of Miyaji et al.'s results for the creation of elliptic curves of prime order with embedding degree 3, 4, or 6 is provided.
- Type
- article
- Published
- 2006-02-01
- Cited by
- 99
- References
- 17
- OpenAlex
- https://openalex.org/W2070030672
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:9552969
Keywords
Elliptic curve, Mathematics, Mathematical analysis
References
- The arithmetic of elliptic curves
- Discrete Logarithms: The Past and the Future
- New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
- Elliptic Curves Suitable for Pairing Based Cryptography
- Prime numbers: A computational perspective
- Short Signatures from the Weil Pairing
- Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields
- Fast evaluation of logarithms in fields of characteristic two
- Elliptic curve public key cryptosystems
- Finite fields
- Efficient Algorithms for Pairing-Based Cryptosystems
- Signcryption scheme for Identity-based Cryptosystems
- AN IDENTITY BASED AUTHENTICATED KEY AGREEMENT PROTOCOL BASED ON THE WEIL PAIRING
- Prime Numbers
- Constructing Elliptic Curves with Prescribed Embedding Degrees
- Identity-Based Encryption from the Weil Pairing
- Implementing the Tate Pairing
- An Efficient Signature Scheme from Bilinear Pairings and Its Applications
Cited by
- Evaluating elliptic curve based KEMs in the light of pairings
- Problèmes autour de courbes élliptiques et modulaires
- Special polynomial families for generating more suitable pairing-friendly elliptic curves
- Contributions to pairing-based cryptography
- A Java based software solution for efficient pairing cryptography.
- Fast Formulas for Computing Cryptographic Pairings
- ペアリングベースの楕円曲線暗号に適した曲線の構成法(応用,数論アルゴリズムとその応用, 平成19年研究部会連合発表会)
- Constructing elliptic curves over finite fields using complex multiplication
- Pairing-Based Cryptography – Pairing 2013
- Traceability, linkability and policy hiding in attribute-based signature schemes
- On the Efficiency and Security of Cryptographic Pairings
- Faster Pairing Computations on Curves with High-Degree Twists
- Topics in Geometry, Coding Theory and Cryptography
- Introducing Ramanujan's Class Polynomials in the Generation of Prime Order Elliptic Curves
- Anonymous, Secure and Efficient Vehicular Communications
- Algebraic curves and cryptography
- On the Efficient Generation of Prime-Order Elliptic Curves
- A Taxonomy of Pairing-Friendly Elliptic Curves
- On the security of generalized Jacobian cryptosystems
- Ordinary abelian varieties having small embedding degree
Related papers
- Primärzerlegung in Steinschen Algebren
- Über unirationale Scharen auf algebraischen Mannigfaltigkeiten
- Algebraic Set Operations, Multifunctions, and Indefinite Integrals
- Produkttreue Klassen universeller Algebren
- Approximation of fixed points of multifunctions in partial metric spaces
- The World of Jagdish N. Srivastava
- Surjectivity of multifunctions under generalized differentiability assumptions
- Kennzeichnung derp-adischen und der endlichen algebraischen Zahlkörper
- Algebraic varieties with automorphism groups of maximal rank
- Kohomologie vonp-Lie-Algebren