Individual discrete logarithm with sublattice reduction

DOI10.1007/s10623-023-01282-wzbMath1527.94011arXiv2309.13048OpenAlexW4310346129MaRDI QIDQ6070357

Cécile Pierrot, Haetham Al Aswad

Publication date: 20 November 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2309.13048

zbMATH Keywords

finite fieldscryptanalysispublic key cryptographydiscrete logarithmtower number field sieveMTNFSSTNFS

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• A one round protocol for tripartite Diffie-Hellman
• The Weil pairing, and its efficient calculation
• Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
• New discrete logarithm computation for the medium prime case using the function field sieve
• Faster initial splitting for small characteristic composite extension degree fields
• A unified polynomial selection method for the (tower) number field sieve algorithm
• The Tower Number Field Sieve
• Computing Individual Discrete Logarithms Faster in $${{\mathrm{GF}}}(p^n)$$ with the NFS-DL Algorithm
• Practical, Predictable Lattice Basis Reduction
• Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
• Breaking ‘128-bit Secure’ Supersingular Binary Curves
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
• The multiple number field sieve for medium- and high-characteristic finite fields
• Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
• The Multiple Number Field Sieve with Conjugation and Generalized Joux-Lercier Methods
• A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Computing Logarithms in Finite Fields of Characteristic Two
• Solving sparse linear equations over finite fields
• Minkowski's Convex Body Theorem and Integer Programming
• Faster individual discrete logarithms in finite fields of composite extension degree
• Using number fields to compute logarithms in finite fields
• Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
• Fast Lattice Point Enumeration with Minimal Overhead
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• The Special Number Field Sieve in $\mathbb{F}_{p^{n}}$
• The Number Field Sieve in the Medium Prime Case
• Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
• Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation

This page was built for publication: Individual discrete logarithm with sublattice reduction