Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
type: Item
instance of: scholarly article
title: Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
zbMATH Open document ID: 1504.94131
DOI: 10.1007/978-3-030-56880-1_2
author: Gabrielle De Micheli
author: Pierrick Gaudry
author: Cécile Pierrot
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614562
zbMATH Keywords: discrete logarithm problem
zbMATH Keywords: pairing-based cryptosystems
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 2
OpenAlex ID: W3035895299
cites work: Q4847920
cites work: Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
cites work: A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
cites work: The Tower Number Field Sieve
cites work: The multiple number field sieve for medium- and high-characteristic finite fields
cites work: Bounds for resultants of univariate and bivariate polynomials
cites work: Q4783728
cites work: Q4474196
cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum''
cites work: An Identity-Based Signature from Gap Diffie-Hellman Groups
cites work: Fast evaluation of logarithms in fields of characteristic two
cites work: Modifications to the number field sieve
cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
cites work: A Kilobit Hidden SNFS Discrete Logarithm Computation
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: Breaking ‘128-bit Secure’ Supersingular Binary Curves
cites work: Indiscreet logarithms in finite fields of small characteristic
cites work: A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
cites work: Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
cites work: A New Index Calculus Algorithm with Complexity $$L(1/4+o(1))$$ in Small Characteristic
cites work: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
cites work: The Function Field Sieve in the Medium Prime Case
cites work: The Number Field Sieve in the Medium Prime Case
cites work: Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
cites work: The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
cites work: Q4226195
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: Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
cites work: On asymptotic complexity of computing discrete logarithms over GF(p)
cites work: Q3840165
cites work: Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case
cites work: A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
cites work: New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
cites work: A unified polynomial selection method for the (tower) number field sieve algorithm
cites work: Virtual logarithms
cites work: Using number fields to compute logarithms in finite fields
description: scientific article; zbMATH DE number 7614562