A taxonomy of pairing-friendly elliptic curves
From MaRDI portal
(Redirected from Publication:2267367)
Recommendations
Cites work
- scientific article; zbMATH DE number 1689862 (Why is no real title available?)
- scientific article; zbMATH DE number 4200379 (Why is no real title available?)
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 3937328 (Why is no real title available?)
- scientific article; zbMATH DE number 1123812 (Why is no real title available?)
- scientific article; zbMATH DE number 1942431 (Why is no real title available?)
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 2081059 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1504543 (Why is no real title available?)
- scientific article; zbMATH DE number 3995691 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- scientific article; zbMATH DE number 1916825 (Why is no real title available?)
- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- A comparison of MNT curves and supersingular curves
- A new proof for the non-degeneracy of the Frey-Rück pairing and a connection to isogenies over the base field
- Abelian Varieties with Prescribed Embedding Degree
- Abelian varieties over finite fields
- Advances in Cryptology – CRYPTO 2004
- Advances in Elliptic Curve Cryptography
- Algorithmic Number Theory
- Algorithmic Number Theory
- An Identity-Based Signature from Gap Diffie-Hellman Groups
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Building curves with arbitrary small MOV degree over finite prime fields
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
- Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
- Cryptography and Coding
- Easy Decision Diffie-Hellman Groups
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- Efficient pairing computation on supersingular abelian varieties
- Elliptic Curves and Primality Proving
- Elliptic curves suitable for pairing based cryptography
- Elliptic curves with low embedding degree
- Endomorphisms of Abelian varieties over finite fields
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Fast algorithms for computing isogenies between elliptic curves
- Fast evaluation of logarithms in fields of characteristic two
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Generating more MNT elliptic curves
- Implementing cryptographic pairings
- MOV attack in various subgroups on elliptic curves
- Monte Carlo Methods for Index Computation (mod p)
- On Compressible Pairings and Their Computation
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- On the Minimal Embedding Field
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Ordinary Abelian varieties having small embedding degree
- Pairing Lattices
- Pairing-Friendly Elliptic Curves of Prime Order
- Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon’s Algorithm
- Pairings for cryptographers
- Parallel collision search with cryptanalytic applications
- Reducing elliptic curve logarithms to logarithms in a finite field
- Selected Areas in Cryptography
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- The Diophantine equation \(x^2 - Dy^2 = N\), \(D>0\)
- The Eta Pairing Revisited
- The Magma algebra system. I: The user language
- The Weil pairing, and its efficient calculation
- The complexity of class polynomial computation via floating point approximations
- The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
Cited in
(only showing first 100 items - show all)- Compact Proofs of Retrievability
- On constructing families of pairing-friendly elliptic curves with variable discriminant
- Compact E-Cash and Simulatable VRFs Revisited
- Another Approach to Pairing Computation in Edwards Coordinates
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
- An optimal Tate pairing computation using Jacobi quartic elliptic curves
- A brief history of pairings
- A subexponential algorithm for evaluating large degree isogenies
- Selected Areas in Cryptography
- Updating key size estimations for pairings
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Optimal pairing computation over families of pairing-friendly elliptic curves
- Pairing-Friendly Elliptic Curves of Prime Order
- Faster Ate pairing computation on Selmer's model of elliptic curves
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
- Faster hashing to \({\mathbb G}_2\)
- Scalable zero knowledge via cycles of elliptic curves
- LOVE a pairing
- Integer Variable χ–Based Ate Pairing
- Algorithmic Number Theory
- Faster computation of the Tate pairing
- Factor base discrete logarithms in Kummer extensions
- Secure and Efficient Pairing at 256-Bit Security Level
- Higher-dimensional sieving for the number field sieve algorithms
- Elliptic curves with \(j=0,1728\) and low embedding degree
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Shorter identity-based encryption via asymmetric pairings
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Faster Pairings on Special Weierstrass Curves
- Subgroup security in pairing-based cryptography
- Polynomial generating pairing and its criterion for optimal pairing
- Finding composite order ordinary elliptic curves using the Cocks-Pinch method
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Optimised Versions of the Ate and Twisted Ate Pairings
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- Pairing-based cryptography on elliptic curves
- Implementing optimized pairings with elliptic nets
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- A new family of pairing-friendly elliptic curves
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- An analysis of affine coordinates for pairing computation
- On Compressible Pairings and Their Computation
- Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields
- Generalised Weber functions
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- On Cycles of Pairing-Friendly Elliptic Curves
- On the elliptic curve endomorphism generator
- Choosing and generating parameters for pairing implementation on BN curves
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Heuristics on pairing-friendly abelian varieties
- An Analysis of the Vector Decomposition Problem
- Constructing pairing-friendly hyperelliptic curves using Weil restriction
- Elliptic curves suitable for pairing based cryptography
- On the embedding degree of reductions of an elliptic curve
- On the efficient implementation of pairing-based protocols
- Hardware implementation of multiplication over quartic extension fields
- Cryptography and Coding
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Efficient selective identity-based encryption without random oracles
- Maximum gap in (inverse) cyclotomic polynomial
- Effective compression maps for torus-based cryptography
- Pairings for cryptographers
- Generating pairing-friendly elliptic curve parameters using sparse families
- Computing Hilbert class polynomials with the Chinese remainder theorem
- Extended tower number field sieve: a new complexity for the medium prime case
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- More Discriminants with the Brezing-Weng Method
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- Efficient multiplication in finite field extensions of degree 5
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
- On a comparison of Cassels pairings of different elliptic curves
- Revisiting cycles of pairing-friendly elliptic curves
- Fast Hashing to G 2 on Pairing-Friendly Curves
- Minimal degrees of algebraic numbers with respect to primitive elements
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- On cycles of pairing-friendly abelian varieties
- A new method for constructing pairing-friendly abelian surfaces
- Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree
- A survey of elliptic curves for proof systems
- Co-factor clearing and subgroup membership testing on pairing-friendly curves
- Unbounded predicate inner product functional encryption from pairings
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- Heuristic counting of Kachisa-Schaefer-Scott curves
- Note on families of pairing-friendly elliptic curves with small embedding degree
- Schinzel hypothesis on average and rational points
- Attractive subfamilies of BLS curves for implementing high-security pairings
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
- Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y 2 = x 5 + ax
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
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)
