Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (Q6157486)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7684754

Language	Label	Description	Also known as
English	Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation	scientific article; zbMATH DE number 7684754

Statements

scholarly article

0 references

Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation (English)

0 references

Gabrielle De Micheli

0 references

Pierrick Gaudry

0 references

Cécile Pierrot

0 references

Lecture Notes in Computer Science

0 references

publication date

12 May 2023

0 references

zbMATH Keywords

number field sieve

0 references

tower variant

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-92062-3_3

0 references

Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields

0 references

A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic

0 references

The Tower Number Field Sieve

0 references

Scalable Zero Knowledge via Cycles of Elliptic Curves

0 references

Faster cofactorization with ECM using mixed representations

0 references

Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis

0 references

Lattice Enumeration Using Extreme Pruning

0 references

On the discrete logarithm problem in finite fields of fixed characteristic

0 references

Computing discrete logarithms in \(\mathbb F_{p^6}\)

0 references

A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level

0 references

Faster individual discrete logarithms in finite fields of composite extension degree

0 references

Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm

0 references

An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$

0 references

The Number Field Sieve in the Medium Prime Case

0 references

Nearly sparse linear algebra and application to discrete logarithms computations

0 references

Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case

0 references

Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree

0 references

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

0 references

Factoring integers with elliptic curves

0 references

Lattice sieving in three dimensions for discrete log in medium characteristic

0 references

Algorithmic Number Theory

0 references

0 references

New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields

0 references

Using number fields to compute logarithms in finite fields

0 references

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

0 references

Solving sparse linear equations over finite fields

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-92062-3_3

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6157486

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6157486&oldid=37515269"