Lattice sieving in three dimensions for discrete log in medium characteristic

DOI10.1515/jmc-2020-0008zbMath1468.11243OpenAlexW3113274316WikidataQ125620725 ScholiaQ125620725MaRDI QIDQ2033517

Gary McGuire, Oisín Robinson

Publication date: 17 June 2021

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc-2020-0008

zbMATH Keywords

number field sievediscrete log

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (2)

Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation

Uses Software

• CADO-NFS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• Computing discrete logarithms in \(\mathbb F_{p^6}\)
• Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
• Collecting relations for the number field sieve in
• Discrete logarithms and local units
• Faster individual discrete logarithms in finite fields of composite extension degree
• Special Units in Real Cyclic Sextic Fields
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Sieving Using Bucket Sort
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• The Number Field Sieve in the Medium Prime Case

This page was built for publication: Lattice sieving in three dimensions for discrete log in medium characteristic