An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\) (Q604101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2010.01.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2080415500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A design for a number theory package with an optimized trial division routine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4046106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring integers with elliptic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2757235 / rank
 
Normal rank

Latest revision as of 10:32, 3 July 2024

scientific article
Language Label Description Also known as
English
An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\)
scientific article

    Statements

    An integrated parallel GNFS algorithm for integer factorization based on linbox montgomery block Lanczos method over \(GF(2)\) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 November 2010
    0 references
    integer factorization
    0 references
    public-key RSA algorithm
    0 references
    GNFS algorithm
    0 references
    linear system over \(GF(2)\)
    0 references
    Lanczos method
    0 references
    parallelization
    0 references
    high performance computing
    0 references
    0 references
    0 references
    0 references

    Identifiers