A taxonomy of pairing-friendly elliptic curves
From MaRDI portal
Publication:2267367
DOI10.1007/S00145-009-9048-ZzbMATH Open1181.94094OpenAlexW2021553056MaRDI QIDQ2267367FDOQ2267367
Publication date: 1 March 2010
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-009-9048-z
Recommendations
Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- The Magma algebra system. I: The user language
- Theory of Cryptography
- MOV attack in various subgroups on elliptic curves
- On Compressible Pairings and Their Computation
- Title not available (Why is that?)
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Pairing-Friendly Elliptic Curves of Prime Order
- Abelian varieties over finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- The Eta Pairing Revisited
- Pairing Lattices
- Advances in Elliptic Curve Cryptography
- Algorithmic Number Theory
- Pairings for cryptographers
- Parallel collision search with cryptanalytic applications
- Reducing elliptic curve logarithms to logarithms in a finite field
- Title not available (Why is that?)
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Endomorphisms of Abelian varieties over finite fields
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Fast evaluation of logarithms in fields of characteristic two
- Fast algorithms for computing isogenies between elliptic curves
- Selected Areas in Cryptography
- Cryptography and Coding
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Elliptic curves suitable for pairing based cryptography
- Title not available (Why is that?)
- Easy Decision Diffie-Hellman Groups
- Title not available (Why is that?)
- Elliptic Curves and Primality Proving
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Title not available (Why is that?)
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Algorithmic Number Theory
- Generating more MNT elliptic curves
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2005
- A new proof for the non-degeneracy of the Frey-Rück pairing and a connection to isogenies over the base field
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Building curves with arbitrary small MOV degree over finite prime fields
- Title not available (Why is that?)
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- Elliptic curves with low embedding degree
- A comparison of MNT curves and supersingular curves
- The complexity of class polynomial computation via floating point approximations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Minimal Embedding Field
- Title not available (Why is that?)
- Abelian Varieties with Prescribed Embedding Degree
- The Diophantine equation \(x^2 - Dy^2 = N\), \(D>0\)
- Ordinary Abelian varieties having small embedding degree
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon’s Algorithm
Cited In (only showing first 100 items - show all)
- An optimal Tate pairing computation using Jacobi quartic elliptic curves
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- On the Efficient Implementation of Pairing-Based Protocols
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Effective compression maps for torus-based cryptography
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Secure and Efficient Pairing at 256-Bit Security Level
- Collecting relations for the number field sieve in
- A Subexponential Algorithm for Evaluating Large Degree Isogenies
- Pairing-based cryptography on elliptic curves
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- Efficient selective identity-based encryption without random oracles
- A Brief History of Pairings
- Faster Ate pairing computation on Selmer's model of elliptic curves
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
- On the elliptic curve endomorphism generator
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Optimal pairing computation over families of pairing-friendly elliptic curves
- Optimised Versions of the Ate and Twisted Ate Pairings
- Updating key size estimations for pairings
- Compact proofs of retrievability
- Heuristics on pairing-friendly abelian varieties
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
- Compact E-Cash and Simulatable VRFs Revisited
- Higher-dimensional sieving for the number field sieve algorithms
- Generating pairing-friendly elliptic curve parameters using sparse families
- More Discriminants with the Brezing-Weng Method
- Compact Proofs of Retrievability
- An Analysis of the Vector Decomposition Problem
- Maximum gap in (inverse) cyclotomic polynomial
- Another Approach to Pairing Computation in Edwards Coordinates
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Generalised Weber functions
- Pairings for cryptographers
- Factor base discrete logarithms in Kummer extensions
- Elliptic curves withj= 0,1728 and low embedding degree
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- On the embedding degree of reductions of an elliptic curve
- LOVE a pairing
- Polynomial generating pairing and its criterion for optimal pairing
- Subgroup Security in Pairing-Based Cryptography
- Hardware implementation of multiplication over quartic extension fields
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Shorter identity-based encryption via asymmetric pairings
- Implementing optimized pairings with elliptic nets
- Selected Areas in Cryptography
- Elliptic curves suitable for pairing based cryptography
- Cryptography and Coding
- Faster computation of the Tate pairing
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Faster Pairings on Special Weierstrass Curves
- On Constructing Families of Pairing-Friendly Elliptic Curves with Variable Discriminant
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
- Scalable zero knowledge via cycles of elliptic curves
- On Compressible Pairings and Their Computation
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Faster Hashing to ${\mathbb G}_2$
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- On Cycles of Pairing-Friendly Elliptic Curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Point Decomposition Problem in Binary Elliptic Curves
- An Analysis of Affine Coordinates for Pairing Computation
- Integer Variable χ–Based Ate Pairing
- Maximum gap in cyclotomic polynomials
- A New Method for Constructing Pairing-Friendly Abelian Surfaces
- Efficient Multiplication in Finite Field Extensions of Degree 5
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- Cryptography on twisted Edwards curves over local fields
- Still wrong use of pairings in cryptography
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
- On a comparison of Cassels pairings of different elliptic curves
- Curves with Fast Computations in the First Pairing Group
- On the near prime-order MNT curves
- New versions of Miller-loop secured against side-channel attacks
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- Efficient system parameters for Identity-Based Encryption using supersingular elliptic curves
- Heuristic counting of Kachisa-Schaefer-Scott curves
- Note on families of pairing-friendly elliptic curves with small embedding degree
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- On Near Prime-Order Elliptic Curves with Small Embedding Degrees
- Unbounded predicate inner product functional encryption from pairings
- Revisiting cycles of pairing-friendly elliptic curves
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- A survey of elliptic curves for proof systems
- Heuristics on pairing-friendly elliptic curves
- RNS arithmetic in 𝔽 pk and application to fast pairing computation
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
- Minimal degrees of algebraic numbers with respect to primitive elements
Uses Software
This page was built for publication: A taxonomy of pairing-friendly elliptic curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267367)
