Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

No abstract is available for this paper.

• Publication year

  2009

• Venue

  International Conference on Theory and Practice of Public Key Cryptography

• Publication date

  2009-03-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-00468-1_1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Floating-Point LLL Revisited

  2005cited by this paper
• Advances in Cryptology - EUROCRYPT 2005, 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005, Proceedings

  2005cited by this paper
• Simple Backdoors for RSA Key Generation

  2003cited by this paper
• Topics in Cryptology — CT-RSA 2003

  2003cited by this paper
• Complexity of lattice problems - a cryptographic perspective

  2002cited by this paper
• Complexity of lattice problems

  2002cited by this paper
• Topics in Cryptology — CT-RSA 2001

  2001cited by this paper
• Cryptography and Lattices

  2001cited by this paper
• An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant Bits

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT’ 92

  2001cited by this paper
• Advances in Cryptology — EUROCRYPT ’96

  2001cited by this paper
• Finding Small Solutions to Small Degree Polynomials

  2001cited by this paper
• Matrix Analysis and Applied Linear Algebra

  2000cited by this paper
• Advances in Cryptology — EUROCRYPT’ 85

  2000cited by this paper
• The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems

  1997cited by this paper
• Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities

  1997influential reference
• Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings

  1997cited by this paper
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

  1996influential reference
• Short RSA keys and their generation

  1995cited by this paper
• Algorithms for quantum computation: discrete logarithms and factoring

  1994cited by this paper
• The Size of a Share Must Be Large

  1994cited by this paper
• The Development of the Number Field Sieve

  1993cited by this paper
• Factoring with an Oracle

  1992cited by this paper
• Minkowski's Convex Body Theorem and Integer Programming

  1987cited by this paper
• Factoring integers with elliptic curves

  1987cited by this paper
• The Quadratic Sieve Factoring Algorithm

  1985cited by this paper
• Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases

  1985cited by this paper
• Efficient Factoring Based on Partial Information

  1985influential reference
• Factoring polynomials with rational coefficients

  1982influential reference
• On Observing Nondeterminism and Concurrency

  1980cited by this paper
• Geometrie der Zahlen

  year unknowncited by this paper
• Improved Analysis of Kannan ’ s Shortest Lattice Vector Algorithm

  year unknowncited by this paper

• Better Bounds for Finding Fixed-Degree Isogenies via Coppersmith's Method

  2025cites this paper
• Lattice-based cryptanalysis of RSA-type cryptosystems: a bibliometric analysis

  2024cites this paper
• Practical Small Private Exponent Attacks against RSA

  2024cites this paper
• An optimal bound for factoring unbalanced RSA moduli by solving Generalized Implicit Factorization Problem

  2024cites this paper
• Implicit Factorization with Shared Any Bits

  2024cites this paper
• Small Public Exponent Brings More: Improved Partial Key Exposure Attacks against RSA

  2024cites this paper
• Generalized implicit-key attacks on RSA

  2023cites this paper
• Applications of Neural Network-Based AI in Cryptography

  2023cites this paper
• The Hidden Number Problem with Small Unknown Multipliers: Cryptanalyzing MEGA in Six Queries and Other Applications

  2023influential citation
• Generalized Implicit Factorization Problem

  2023cites this paper
• A new idea for RSA backdoors

  2022cites this paper
• Revisiting orthogonal lattice attacks on approximate common divisor problems

  2022cites this paper
• Cryptanalysis of Modular Exponentiation Outsourcing Protocols

  2021cites this paper
• Overview of Lattice-Based Methods in Cryptanalysis

  2020cites this paper
• Implicit-Key Attack on the RSA Cryptosystem

  2019cites this paper
• Implicit Related-Key Factorization Problem on the RSA Cryptosystem

  2019cites this paper
• On oracle factoring of integers

  2019cites this paper
• Finding Small Solutions of the Equation Bx-Ay=z and Its Applications to Cryptanalysis of the RSA Cryptosystem

  2018influential citation
• Deterministic factoring with oracles

  2018cites this paper
• A Method for Solving Generalized Implicit Factorization Problem

  2018cites this paper
• Analysis of Hidden Number Problem with Hidden Multiplier

  2017cites this paper
• Fast Internet-Wide Scanning: A New Security Perspective

  2017cites this paper
• A probabilistic analysis on a lattice attack against DSA

  2017cites this paper
• A better bound for implicit factorization problem with shared middle bits

  2017influential citation
• Cryptanalysis of NTRU with n public keys

  2017cites this paper
• Recent Progress on Coppersmith's Lattice-Based Method: A Survey

  2017cites this paper
• Improved Results on Cryptanalysis of Prime Power RSA

  2016cites this paper
• Partial Key Exposure Attacks on CRT-RSA: General Improvement for the Exposed Least Significant Bits

  2016cites this paper
• Easing Coppersmith Methods Using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness

  2016cites this paper
• PAPER Special Section on Discrete Mathematics and Its Applications A Simple Improvement for Integer Factorizations with Implicit Hints

  2016cites this paper
• A Simple Improvement for Integer Factorizations with Implicit Hints

  2016influential citation
• Towards Optimal Bounds for Implicit Factorization Problem

  2015influential citation
• A Simple and Improved Algorithm for Integer Factorization with Implicit Hints

  2015influential citation
• Solving Linear Equations Modulo Unknown Divisors: Revisited

  2015cites this paper
• Implicit Factorization of RSA Moduli Revisited (Short Paper)

  2015influential citation
• Topics in Cryptology –- CT-RSA 2015

  2015cites this paper
• Further Improvement of Factoring RSA Moduli with Implicit Hint

  2014cites this paper
• Cryptanalysis of NTRU with two Public Keys

  2014cites this paper
• Finding Small Solutions of a Class of Simultaneous Modular Equations and Applications to Modular Inversion Hidden Number Problem and Inversive Congruential Generator

  2014cites this paper
• Implicit Factoring with Shared Middle Discrete Bits

  2014cites this paper
• New Method for Factoring RSA Moduli with Implicit Hint

  2014cites this paper
• Implicit factorization of unbalanced RSA moduli

  2014influential citation
• New method for factoring two RSA moduli with implicit hint

  2014cites this paper
• Cryptanalysis of RSA with Multiple Small Secret Exponents

  2014cites this paper
• Factoring RSA keys from certified smart cards: Coppersmith in the wild

  2013cites this paper
• Improved bounds for the implicit factorization problem

  2013cites this paper
• Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors

  2013cites this paper
• How to Factor N 1 and N 2 When $p_1=p_2 \bmod 2^t$

  2013influential citation
• How to Factor N1 and N2 When p1=p2 mod 2t

  2013cites this paper
• Mining Your Ps and Qs: Detection of Widespread Weak Keys in Network Devices

  2012cites this paper
• Attacking (EC)DSA Given Only an Implicit Hint

  2012cites this paper
• Analyse des générateurs de nombres aléatoires dans des conditions anormales d'utilisation. (Analysis of random number generators in abnormal usage conditions)

  2012cites this paper
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization

  2011influential citation
• Implicit Factoring with Shared Most Significant and Middle Bits

  2010influential citation
• Some applications of lattice based root finding techniques

  2010cites this paper
• On efficiently calculating small solutions of systems of polynomial equations: lattice-based methods and applications to cryptography

  2010cites this paper
• Factoring Unbalanced Moduli with Known Bits

  2009cites this paper
• Further results on implicit factoring in polynomial time

  2009influential citation
• Newton Polytope-Based Strategy for Finding Small Roots of Multivariate Polynomials

  year unknowncites this paper
• Revisit Unravelled Linearization with Erhart (quasi-)Polynomial

  year unknowncites this paper