On the coefficients of the polynomial in the number field sieve

DOI10.1007/S11432-015-5331-9zbMATH Open1497.94130OpenAlexW2214988138MaRDI QIDQ5046489FDOQ5046489

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

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

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)