Optimal Pairings
From MaRDI portal
Recommendations
Cited in
(66)- Pattern matching on encrypted streams
- Scalable zero knowledge via cycles of elliptic curves
- Parallelizing pairings on Hessian elliptic curves
- Choosing and generating parameters for pairing implementation on BN curves
- Simple and exact formula for minimum loop length in \(\mathrm{Ate}_{i }\) pairing based on Brezing-Weng curves
- Faster pairing computation on genus 2 hyperelliptic curves
- Updating key size estimations for pairings
- Hardware implementation of multiplication over quartic extension fields
- LOVE a pairing
- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- A survey on delegated computation
- Families of SNARK-friendly 2-chains of elliptic curves
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Secure and efficient delegation of elliptic-curve pairing
- On cryptographic protocols employing asymmetric pairings -- the role of \(\Psi \) revisited
- Beta Weil pairing revisited
- Improving the computation of the optimal ate pairing for a high security level
- Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves
- Pairing inversion for finding discrete logarithms
- Faster Ate pairing computation on Selmer's model of elliptic curves
- Faster hashing to \({\mathbb G}_2\)
- Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
- Subgroup security in pairing-based cryptography
- Higher-order side channel security and mask refreshing
- Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography
- An improvement of optimal ate pairing on KSS curve with pseudo 12-sparse multiplication
- Further refinements of Miller's algorithm on Edwards curves
- RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
- An analysis of affine coordinates for pairing computation
- Cryptographic pairings based on elliptic nets
- Parallelizing the Weil and Tate pairings
- On the efficient implementation of pairing-based protocols
- Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2
- Attractive subfamilies of BLS curves for implementing high-security pairings
- An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
- Computing fixed argument pairings with the elliptic net algorithm
- The optimal ate pairing over the Barreto-Naehrig curve via parallelizing elliptic nets
- Selecting Complementary Pairs of Literals
- Pairing computation on Edwards curves with high-degree twists
- Efficient implementation of bilinear pairings on ARM processors
- Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
- Optimal pairing computation over families of pairing-friendly elliptic curves
- Maximum gap in (inverse) cyclotomic polynomial
- The pairing computation on Edwards curves
- Efficient self-pairing on ordinary elliptic curves
- Fixed argument pairing inversion on elliptic curves
- Pairing-based cryptography
- A survey of elliptic curves for proof systems
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
- scientific article; zbMATH DE number 7746256 (Why is no real title available?)
- New versions of Miller-loop secured against side-channel attacks
- Secure and Efficient Pairing at 256-Bit Security Level
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
- Curves with Fast Computations in the First Pairing Group
- Pairings in rank-1 constraint systems
- Effective pairings in isogeny-based cryptography
- Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k=5,7
- The Tate profile
- Biextensions in pairing-based cryptography
- Revisiting pairing-friendly curves with embedding degrees 10 and 14
- x-superoptimal pairings on elliptic curves with odd prime embedding degrees: BW13-P310 and BW19-P286
- Computing pairings on elliptic curves with embedding degree two via biextensions
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
- Polynomial generating pairing and its criterion for optimal pairing
- A survey of fault attacks in pairing based cryptography
This page was built for publication: Optimal Pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976063)
