Efficient Factoring Based on Partial Information

DOI10.1007/3-540-39805-8_3zbMath0589.94004OpenAlexW1544369918MaRDI QIDQ3718616

Ronald L. Rivest, Adi Shamir

Publication date: 1986

Published in: Advances in Cryptology — EUROCRYPT’ 85 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-39805-8_3

zbMATH Keywords

cryptologyside informationfactoring large composite integers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Factorization (11Y05)

Related Items (14)

Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ Factoring RSA moduli with primes sharing bits in the middle ⋮ Acoustic cryptanalysis ⋮ Practical attacks on small private exponent RSA: new records and new insights ⋮ Deterministic factoring with oracles ⋮ Constructive complexity ⋮ Non-Interactive Key Exchange ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits ⋮ 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 ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ The discrete logarithm modulo a composite hides \(O(n)\) bits

This page was built for publication: Efficient Factoring Based on Partial Information