On the coefficients of the polynomial in the number field sieve

DOI10.1007/s11432-015-5331-9zbMath1497.94130OpenAlexW2214988138MaRDI QIDQ5046489

Li Li, Huanguo Zhang, Qingshu Meng, Min Yang, Zhangyi Wang

Publication date: 28 October 2022

Published in: Science China Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11432-015-5331-9

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Capability of evolutionary cryptosystems against differential cryptanalysis
• Evolutionary cryptography against multidimensional linear cryptanalysis
• Non-linear polynomial selection for the number field sieve
• A complete discrimination system for polynomials
• Improved nonlinear multiuser precoding using lattice reduction
• Factoring polynomials with rational coefficients
• Recent advances on determining the number of real roots of parametric polynomials
• An Implementation of the Number Field Sieve
• On polynomial selection for the general number field sieve
• Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
• Root optimization of polynomials in the number field sieve
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: On the coefficients of the polynomial in the number field sieve