On the coefficients of the polynomial in the number field sieve

DOI10.1007/S11432-015-5331-9MaRDI QIDQ5046489zbMATH OpenOpenAlexFDO

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

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

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5046489)