A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
From MaRDI portal
Publication:2055706
DOI10.1007/978-3-030-45388-6_19zbMath1481.94104OpenAlexW2994293923MaRDI QIDQ2055706
Publication date: 1 December 2021
Full work available at URL: https://hal.inria.fr/hal-02396352v2/file/Curves_128_STNFS_05022020.pdf
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Curves over finite and local fields (11G20) Authentication, digital signatures and secret sharing (94A62)
Related Items (15)
LOVE a pairing ⋮ Faster beta Weil pairing on BLS pairing friendly curves with odd embedding degree ⋮ Families of SNARK-friendly 2-chains of elliptic curves ⋮ A survey of elliptic curves for proof systems ⋮ Systematizing core properties of pairing-based attribute-based encryption to uncover remaining challenges in enforcing access control in practice ⋮ 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 ⋮ Optimal generic attack against basic Boneh-Boyen signatures ⋮ MyOPE: malicious security for oblivious polynomial evaluation ⋮ Fast hashing to \(\mathbb{G}_2\) on pairing-friendly curves with the lack of twists ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Finite field arithmetic in large characteristic for classical and post-quantum cryptography ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Hardware implementation of multiplication over quartic extension fields ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
Cites Work
- Unnamed Item
- HT90 and ``simplest number fields
- A new family of pairing-friendly elliptic curves
- Updating key size estimations for pairings
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- A taxonomy of pairing-friendly elliptic curves
- TNFS resistant families of pairing-friendly elliptic curves
- Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
- Faster computation of the Tate pairing
- Elliptic curves suitable for pairing based cryptography
- The Tower Number Field Sieve
- Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
- Five, six, and seven-term Karatsuba-like formulae
- Faster Pairing Computations on Curves with High-Degree Twists
- On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Advances in Elliptic Curve Cryptography
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- On Cycles of Pairing-Friendly Elliptic Curves
- The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
- Selecting cryptographic key sizes
This page was built for publication: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
