Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (Q3600388): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-89255-7_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1490771242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of RSA with private key d less than N/sup 0.292/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography - PKC 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-density subset sum algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic polynomial-time equivalence of computing the RSA secret key and factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Small Root of a Univariate Modular Equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small solutions to polynomial equations, and low exponent RSA vulnerabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Simultaneous Modular Equations of Low Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the oracle complexity of factoring integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - EUROCRYPT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floating-Point LLL Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Factoring Based on Partial Information / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:00, 29 June 2024

scientific article
Language Label Description Also known as
English
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
scientific article

    Statements

    Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits (English)
    0 references
    0 references
    0 references
    10 February 2009
    0 references
    lattices
    0 references
    small roots
    0 references
    factoring with known bits
    0 references

    Identifiers