Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
type: Item
instance of: scholarly article
title: Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
zbMATH Open document ID: 1384.94075
DOI: 10.1007/978-3-662-53018-4_20
author: Taechan Kim
author: Razvan Barbulescu
published in: Advances in Cryptology – CRYPTO 2016
publication date: 2016-11-30T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11T71
zbMATH DE Number: 6657564
zbMATH Keywords: discrete logarithm problem
zbMATH Keywords: number field sieve
zbMATH Keywords: finite fields
zbMATH Keywords: cryptanalysis
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-662-53018-4 20
OpenAlex ID: W2406585997
cites work: A Kilobit Special Number Field Sieve Factorization
cites work: Implementing Pairings at the 192-Bit Security Level
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: Pairing-Friendly Elliptic Curves of Prime Order
cites work: High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
cites work: Bounds for resultants of univariate and bivariate polynomials
cites work: A Homomorphic LWE Based E-voting Scheme
cites work: Public Key Cryptography - PKC 2006
cites work: Algorithmic Number Theory
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve
cites work: The Number Field Sieve in the Medium Prime Case
cites work: The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
cites work: Q4474166
cites work: Factoring integers with elliptic curves
cites work: The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
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
cites work: Solving sparse linear equations over finite fields
description: scientific article; zbMATH DE number 6657564