Efficient Factoring Based on Partial Information
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2077079
- scientific article; zbMATH DE number 3882077
- scientific article; zbMATH DE number 991430
- scientific article; zbMATH DE number 434791
- Further improvement of factoring \(N=p^rq^s\) with partial known bits
- Incomplete factorization methods and its application
- A Note on the Efficiency of Domain Decomposed Incomplete Factorizations
- Asymptotically Fast Factorization of Integers
- Factoring polynomials using fewer random bits
- An explicit factorization algorithm
Cited in
(16)- Constructive complexity
- The discrete logarithm modulo a composite hides \(O(n)\) bits
- Factoring RSA moduli with primes sharing bits in the middle
- A probabilistic analysis on a lattice attack against DSA
- Acoustic cryptanalysis
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- A deterministic algorithm for integer factorization
- Towards optimal bounds for implicit factorization problem
- Implicit Factoring with Shared Most Significant and Middle Bits
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Non-interactive key exchange
- Using LLL-reduction for solving RSA and factorization problems
- Practical attacks on small private exponent RSA: new records and new insights
- Deterministic factoring with oracles
- Leakage-resilient hardness equivalence to logspace derandomization
This page was built for publication: Efficient Factoring Based on Partial Information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718616)
