A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
type: Item
instance of: scholarly article
title: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
zbMATH Open document ID: 1481.94104
DOI: 10.1007/978-3-030-45388-6_19
author: Aurore Guillevic
publication date: 2021-12-01T00:00:00Z
full work available at URL: Curves 128 STNFS 05022020.pdf
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 11G20
zbMATH DE Number: 7436984
zbMATH Keywords: tower number field sieve algorithm
MaRDI profile type: Publication
OpenAlex ID: W2994293923
cites work: Faster computation of the Tate pairing
cites work: Updating key size estimations for pairings
cites work: The Tower Number Field Sieve
cites work: Q4414287
cites work: Elliptic curves suitable for pairing based cryptography
cites work: On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One
cites work: Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
cites work: On Cycles of Pairing-Friendly Elliptic Curves
cites work: Faster Pairing Computations on Curves with High-Degree Twists
cites work: Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings
cites work: HT90 and ``simplest'' number fields
cites work: TNFS resistant families of pairing-friendly elliptic curves
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Advances in Elliptic Curve Cryptography
cites work: Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
cites work: The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
cites work: Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
cites work: Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
cites work: Selecting cryptographic key sizes
cites work: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
cites work: Five, six, and seven-term Karatsuba-like formulae
cites work: A new family of pairing-friendly elliptic curves
cites work: Easy scalar decompositions for efficient scalar multiplication on elliptic curves and genus 2 Jacobians
description: scientific article; zbMATH DE number 7436984