Lattice sieving in three dimensions for discrete log in medium characteristic
type: Item
instance of: scholarly article
title: Lattice sieving in three dimensions for discrete log in medium characteristic
zbMATH Open document ID: 1468.11243
author: Gary McGuire
author: Oisín Robinson
published in: Journal of Mathematical Cryptology
publication date: 2021-06-17T00:00:00Z
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 7360416
zbMATH Keywords: number field sieve
zbMATH Keywords: discrete log
describes a project that uses: CADO-NFS
MaRDI profile type: Publication
full work available at URL: jmc-2020-0008
OpenAlex ID: W3113274316
Wikidata QID: Q125620725
cites work: Sieving Using Bucket Sort
cites work: On Lovász' lattice reduction and the nearest lattice point problem
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: Q3139838
cites work: Q3729014
cites work: Collecting relations for the number field sieve in
cites work: Special Units in Real Cyclic Sextic Fields
cites work: Computing discrete logarithms in \(\mathbb F_{p^6}\)
cites work: Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
cites work: Faster individual discrete logarithms in finite fields of composite extension degree
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: Q4273680
cites work: A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
cites work: Discrete logarithms and local units
DOI: 10.1515/JMC-2020-0008
description: scientific article; zbMATH DE number 7360416