Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546): 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-642-02295-1_10 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W10068438 / 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: Breaking RSA may not be equivalent to factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking RSA may be as difficult as factoring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances in RSA cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3728066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring integers with elliptic curves / 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: Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known / 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: Q3202941 / 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: Q4787196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Provable Security of an Efficient RSA-Based Pseudorandom Generator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / 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 smooth integers in short intervals using CRT decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of short RSA secret exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of RSA with Private Key d Less than N 0.292 / 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: A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the security of RSA with primes sharing least-significant bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials and the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Floating-Point LLL Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The security of all RSA and discrete log bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger security proofs for RSA and Rabin bits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5748797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Exponent RSA with Related Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Factoring Based on Partial Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography - PKC 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Key Exposure Attacks on RSA up to Full Size Exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptanalysis of RSA with small prime difference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Cryptology – CT-RSA 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography – PKC 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4409122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information Security and Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of Square-Free Integers with High Bits Known / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography – PKC 2004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:08, 2 July 2024

scientific article; zbMATH DE number 5677888
Language Label Description Also known as
English
Using LLL-Reduction for Solving RSA and Factorization Problems
scientific article; zbMATH DE number 5677888

    Statements

    Using LLL-Reduction for Solving RSA and Factorization Problems (English)
    0 references
    0 references
    5 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references