Montgomery's method of polynomial selection for the number field sieve

Type: Preprint

Publication Date: 2014-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1412.6011

Locations

  • arXiv (Cornell University) - View - PDF
  • HAL (Le Centre pour la Communication Scientifique Directe) - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ Montgomery's method of polynomial selection for the number field sieve 2015 Nicholas Coxon
+ Montgomery's method of polynomial selection for the number field sieve 2014 Nicholas Coxon
+ On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve. 2011 Namhun Koo
Gooc Hwa Jo
Soonhak Kwon
+ A Montgomery-like square root for the Number Field Sieve 1998 Phong H. Nguyen
+ Root optimization of polynomials in the number field sieve 2015 Shi Bai
Richard P. Brent
Emmanuel Thomé
+ Root Optimization of Polynomials in the Number Field Sieve. 2012 Shi Bai
Richard P. Brent
Emmanuel Thomé
+ On nonlinear polynomial selection for the number field sieve 2011 Nicholas Coxon
+ On nonlinear polynomial selection for the number field sieve 2011 Nicholas Coxon
+ Polynomial selection for the number field sieve 2011 Shi Bai
+ Polynomial Selection for the Number Field Sieve in an Elementary Geometric View 2013 Min Yang
Qingshu Meng
Zhangyi Wang
Lina Wang
Huanguo Zhang
+ Polynomial Selection for the Number Field Sieve 2017 Thorsten Kleinjung
+ Modelling the yield of number field sieve polynomials 1998 Brian Murphy
+ Number Field Sieve 2013 Ruben Grønning Spaans
+ We are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve 2023 Charles Bouillaguet
Ambroise Fleury
Pierre-Alain Fouque
Paul Kirchner
+ A look at the Special Number Field Sieve using ideals as implementable in the magma computational algebra software system 2011 Renee Marie Thompson
+ How to Choose the Polynomials for Number Field Sieve overGF(p) 2011 健一郎 早坂
剛 高木
+ The Number Field Sieve 2005 Steven J. Byrnes
+ An Analysis of Some Prime Generating Sieves 2010 Alok Chakrabarty
Bipul Shyam Purkayastha
+ Sieving polynomial for factorization of numbers of the form $n = m^5+a_4m^4+a_3m^3+a_2m^2+a_1m+a_0$ for $a_i<<m$ 2019
+ PDF Chat New frameworks for Montgomery’s modular multiplication method 2003 Philip B. McLaughlin

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors