Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (Q2096516): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Kilobit Special Number Field Sieve Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better polynomials for GNFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster cofactorization with ECM using mixed representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2739444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139838 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization Using the Quadratic Sieve Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Kilobit Hidden SNFS Discrete Logarithm Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online order basis algorithm and its impact on the block Wiedemann algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The middle product algorithm. I: Speeding up the division and square root of power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems / 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: Mersenne Factorization Factory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of a 768-Bit Prime Field Discrete Logarithm / 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: Q4325965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete logarithms and local units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square Root Algorithms for the Number Field Sieve / rank
 
Normal rank

Latest revision as of 18:35, 30 July 2024

scientific article
Language Label Description Also known as
English
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
scientific article

    Statements

    Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    factorization of RSA-240
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers