Montgomery's method of polynomial selection for the number field sieve (Q745185): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.laa.2015.07.025 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963436579 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1109.6398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Distinct Terms in the Expansion of Symmetric and Skew Determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better polynomials for GNFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Root optimization of polynomials in the number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinantal identities: Gauss, Schur, Cauchy, Sylvester, Kronecker, Jacobi, Binet, Laplace, Muir, and Cayley / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Oppenheim concerning ''Factorisatio Numerorum'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Montgomery's method of polynomial selection for the number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary approach to subresultants theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMMON FACTORS OF RESULTANTS MODULO <i>p</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial selection for the general number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of a 768-Bit RSA Modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON NONLINEAR POLYNOMIAL SELECTION AND GEOMETRIC PROGRESSION (MOD N) FOR NUMBER FIELD SIEVE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The development of the number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The LLL algorithm. Survey and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-linear polynomial selection for the number field sieve / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for obtaining digital signatures and public-key cryptosystems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicitizing rational curves by the method of moving algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162309 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.LAA.2015.07.025 / rank
 
Normal rank

Latest revision as of 02:54, 10 December 2024

scientific article
Language Label Description Also known as
English
Montgomery's method of polynomial selection for the number field sieve
scientific article

    Statements

    Montgomery's method of polynomial selection for the number field sieve (English)
    0 references
    0 references
    13 October 2015
    0 references
    integer factorisation
    0 references
    number field sieve
    0 references
    polynomial selection
    0 references
    Montgomery's method
    0 references

    Identifiers