Computing discrete logarithms in \(\mathbb F_{p^6}\)
type: Item
instance of: scholarly article
title: Computing discrete logarithms in \(\mathbb F_{p^6}\)
zbMATH Open document ID: 1384.94066
DOI: 10.1007/978-3-319-72565-9_5
author: Laurent Grémy
author: Aurore Guillevic
author: François Morain
author: Emmanuel Thomé
publication date: 2018-04-26T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 6864955
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-319-72565-9 5
OpenAlex ID: W2781216073
cites work: Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields
cites work: The multiple number field sieve for medium- and high-characteristic finite fields
cites work: Updating key size estimations for pairings
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: Bounds for resultants of univariate and bivariate polynomials
cites work: Q4783728
cites work: Q4474196
cites work: Self-pairings on supersingular elliptic curves with embedding degree \textit{three}
cites work: Modifications to the number field sieve
cites work: An Implementation of the Number Field Sieve
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: A Kilobit Hidden SNFS Discrete Logarithm Computation
cites work: Collecting relations for the number field sieve in
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: Breaking ‘128-bit Secure’ Supersingular Binary Curves
cites work: On the Discrete Logarithm Problem on Algebraic Tori
cites work: Special Units in Real Cyclic Sextic Fields
cites work: Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
cites work: An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12)
cites work: Q2739458
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 Number Field Sieve in the Medium Prime Case
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: Q4536791
cites work: Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting
cites work: On asymptotic complexity of computing discrete logarithms over GF(p)
cites work: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
cites work: Q2763028
cites work: The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
cites work: Q4273680
cites work: Advances in Cryptology - CRYPTO 2003
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: Discrete logarithms and local units
cites work: Using number fields to compute logarithms in finite fields
description: scientific article; zbMATH DE number 6864955