Curves with Fast Computations in the First Pairing Group
From MaRDI portal
Recommendations
Cites work
- A one round protocol for tripartite Diffie-Hellman
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- A taxonomy of pairing-friendly elliptic curves
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Candidate Multilinear Maps from Ideal Lattices
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Cryptanalysis of the CLT13 multilinear map
- Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming
- Elliptic curves suitable for pairing based cryptography
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Extended tower number field sieve: a new complexity for the medium prime case
- Get shorty via group signatures without encryption
- scientific article; zbMATH DE number 1952905 (Why is no real title available?)
- scientific article; zbMATH DE number 1842492 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Monte Carlo Methods for Index Computation (mod p)
- New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
- On the correct use of the negation map in the Pollard rho method
- On the Final Exponentiation in Tate Pairing Computations
- Optimal Pairings
- Pairing-Friendly Elliptic Curves of Prime Order
- Pairings for cryptographers
- Practical multilinear maps over the integers
- Short randomizable signatures
- Structure-preserving signatures on equivalence classes and constant-size anonymous credentials
- Type 2 structure-preserving signature schemes revisited
- Updating key size estimations for pairings
Cited in
(15)- Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree
- Families of SNARK-friendly 2-chains of elliptic curves
- scientific article; zbMATH DE number 1643937 (Why is no real title available?)
- Pairing-Friendly Elliptic Curves of Prime Order
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves
- GLUE: generalizing unbounded attribute-based encryption for flexible efficiency trade-offs
- TinyABE: unrestricted ciphertext-policy attribute-based encryption for embedded devices and low-quality networks
- Co-factor clearing and subgroup membership testing on pairing-friendly curves
- Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists
- Finite field arithmetic in large characteristic for classical and post-quantum cryptography
- Faster optimal ate pairings for cyclotomic sparse families of pairing-friendly elliptic curves with embedding degrees k=5,7
- 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
- On the alpha value of polynomials in the tower number field sieve algorithm
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
This page was built for publication: Curves with Fast Computations in the First Pairing Group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488030)
