Selecting polynomials for the Function Field Sieve

DOI10.1090/S0025-5718-2015-02940-8zbMath1326.11079arXiv1303.1998MaRDI QIDQ5501157

Razvan Barbulescu

Publication date: 13 August 2015

Published in: Mathematics of Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (1)

Some mathematical remarks on the polynomial selection in NFS

Uses Software

• Magma

Cites Work

• Non-linear polynomial selection for the number field sieve
• The Magma algebra system. I: The user language
• Function field sieve method for discrete logarithms over finite fields
• Fast evaluation of logarithms in fields of characteristic two
• Solving a 676-Bit Discrete Logarithm Problem in GF(36n )
• The Function Field Sieve in the Medium Prime Case
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
• Breaking Pairing-Based Cryptosystems Using η T Pairing over GF(397)
• Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields
• A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Selecting polynomials for the Function Field Sieve