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)- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Faster computation of the Tate pairing
- Cryptography and Coding
- Heuristics of the Cocks-Pinch method
- On the number of isogeny classes of pairing-friendly elliptic curves and statistics of MNT curves
- Pairing computation on Edwards curves with high-degree twists
- Computing Hilbert class polynomials with the Chinese remainder theorem
- MNT elliptic curves with non-prime order
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Concurrently secure blind Schnorr signatures
- Families of prime-order endomorphism-equipped embedded curves on pairing-friendly curves
- PMNS arithmetic for elliptic curve cryptography
- Faster Pairings on Special Weierstrass Curves
- TNFS resistant families of pairing-friendly elliptic curves
- Biextensions in pairing-based cryptography
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- On the efficient implementation of pairing-based protocols
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields
- Scalable zero knowledge via cycles of elliptic curves
- Fine-grained complexity in a world without cryptography
- A new method for constructing pairing-friendly abelian surfaces
- Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree
- Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction
- On Compressible Pairings and Their Computation
- On cycles of pairing-friendly abelian varieties
- Generating Pairing-Friendly Curves with the CM Equation of Degree 1
- Efficient multiplication in finite field extensions of degree 5
- Schinzel hypothesis on average and rational points
- Exponentiation in Pairing-Friendly Groups Using Homomorphisms
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction
- Constructing Pairing-Friendly Elliptic Curves Using Factorization of Cyclotomic Polynomials
- Computing pairings on elliptic curves with embedding degree two via biextensions
- On Cycles of Pairing-Friendly Elliptic Curves
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- Optimizing and securing GLV multiplication over BLS pairings-friendly curves
- On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves
- Expander graphs based on GRH with an application to elliptic curve cryptography
- Integer Variable χ–Based Ate Pairing
- Maximum gap in cyclotomic polynomials
- Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
- An optimal Tate pairing computation using Jacobi quartic elliptic curves
- Algorithmic Number Theory
- An algebraic point of view on the generation of pairing-friendly curves
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Effective compression maps for torus-based cryptography
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Pairing-friendly elliptic curves of embedding degree 1 and applications to cryptography
- 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
- Revisiting pairing-friendly curves with embedding degrees 10 and 14
- Pairing Computation on Twisted Edwards Form Elliptic Curves
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography
- Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon’s Algorithm
- Cryptography on twisted Edwards curves over local fields
- Efficient system parameters for identity-based encryption using supersingular elliptic curves
- Pairing-Friendly Elliptic Curves of Prime Order
- Still wrong use of pairings in cryptography
- Secure and Efficient Pairing at 256-Bit Security Level
- Pairing-based cryptography on elliptic curves
- Efficient selective identity-based encryption without random oracles
- On near prime-order elliptic curves with small embedding degrees
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
- Faster Ate pairing computation on Selmer's model of elliptic curves
- On the elliptic curves \(y^{2}=x^{3} - c\) with embedding degree one
- Elliptic curves with j=0,1728 and low embedding degree
- On the elliptic curve endomorphism generator
- Choosing and generating parameters for pairing implementation on BN curves
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Optimal pairing computation over families of pairing-friendly elliptic curves
- On the computation of class polynomials with ``thetanullwerte`` and its applications to the unit group computation
- Constructing families of pairing-friendly elliptic curves with small -value and rational solutions of some systems of polynomial equations
- On chains of pairing-friendly elliptic curves
- Subgroup security in pairing-based cryptography
- Optimised Versions of the Ate and Twisted Ate Pairings
- Updating key size estimations for pairings
- On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One
- Compact proofs of retrievability
- Heuristics on pairing-friendly abelian varieties
- Extended tower number field sieve: a new complexity for the medium prime case
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
- 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
- On the near prime-order MNT curves
- On a comparison of Cassels pairings of different elliptic curves
- On constructing parameterized families of pairing-friendly elliptic curves with =1
- Compact E-Cash and Simulatable VRFs Revisited
- Curves with Fast Computations in the First Pairing Group
- New versions of Miller-loop secured against side-channel attacks
- Generating pairing-friendly elliptic curve parameters using sparse families
- Efficient hash maps to \(\mathbb{G}_2\) on BLS curves
- x-superoptimal pairings on elliptic curves with odd prime embedding degrees: BW13-P310 and BW19-P286
- Higher-dimensional sieving for the number field sieve algorithms
- Compact Proofs of Retrievability
- Maximum gap in (inverse) cyclotomic polynomial
- Heuristic counting of Kachisa-Schaefer-Scott curves
- Note on families of pairing-friendly elliptic curves with small embedding degree
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)
