Efficient Factoring Based on Partial Information

No abstract is available for this paper.

• Publication year

  1985

• Venue

  International Conference on the Theory and Application of Cryptographic Techniques

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-39805-8_3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Integer Programming with a Fixed Number of Variables

  1983cited by this paper
• How to exchange (secret) keys

  1983cited by this paper

• Optimizing the selection of the secret parameters for public key cryptosystems by using interval linear programming and fully fuzzy linear programming

  2025cites this paper
• A Novel Leakage Model in OpenSSL's Miller-Rabin Primality Test

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

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

  2024cites this paper
• Guest Column: New ways of studying the BPP = P conjecture

  2023cites this paper
• Cryptanalysis of RSA with composed decryption exponent with few most significant bits of one of the primes

  2023cites this paper
• Solving Generalized Bivariate Integer Equations and Its Application to Factoring With Known Bits

  2023cites this paper
• Leakage-Resilient Hardness Equivalence to Logspace Derandomization

  2023cites this paper
• Partial key exposure attack on RSA using some private key blocks

  2023cites this paper
• New ways of studying the BPP = P conjecture

  2023cites this paper
• Optical Cryptanalysis: Recovering Cryptographic Keys from Power LED Light Fluctuations

  2023cites this paper
• Practical attacks on small private exponent RSA: new records and new insights

  2023cites this paper
• Cryptanalysis of RSA with small difference of primes and two decryption exponents: Jochemsz and May approach

  2022cites this paper
• Leakage-Resilient Hardness v.s. Randomness

  2022cites this paper
• A new idea for RSA backdoors

  2022cites this paper
• A New LSB Attack on Special-Structured RSA Primes

  2020cites this paper
• Improved Secure Integer Comparison via Homomorphic Encryption

  2020cites this paper
• Partial Key Attack Given MSBs of CRT-RSA Private Keys

  2020cites this paper
• Improved Results on Factoring General RSA Moduli with Known Bits

  2018cites this paper
• Factoring RSA moduli with primes sharing bits in the middle

  2018cites this paper
• Deterministic factoring with oracles

  2018cites this paper
• Attacking Noisy Secret CRT-RSA Exponents in Binary Method

  2018cites this paper
• Cryptanalysis of an RSA variant with moduli N=prql

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

  2017cites this paper
• Secure Computation in Hostile Environments

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

  2016cites this paper
• Acoustic Cryptanalysis

  2016cites this paper
• Towards Optimal Bounds for Implicit Factorization Problem

  2015influential citation
• Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents

  2015cites this paper
• Solving Linear Equations Modulo Unknown Divisors: Revisited

  2015cites this paper
• Hidden in snow, revealed in thaw: Cold boot attacks revisited

  2014influential citation
• RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis

  2014cites this paper
• A deterministic algorithm for integer factorization

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

  2013cites this paper
• Error Correction of Partially Exposed RSA Private Keys from MSB Side

  2013cites this paper
• RSA private key reconstruction from random bits using SAT solvers

  2013cites this paper
• A New Construction of Lattice based on RSA Public Key Cryptosystem

  2013influential citation
• Recovering RSA private keys on implementations with tampered LSBs

  2013cites this paper
• Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits

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

  2013cites this paper
• Factoring RSA Modulus with Known Bits from Both p and q: A Lattice Method

  2013cites this paper
• How to Factor N1 and N2 When p1=p2 mod 2t

  2013cites this paper
• A Coding-Theoretic Approach to Cryptanalysis

  2013cites this paper
• A Coding-Theoretic Approach to Recovering Noisy RSA Keys

  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
• Advice and Randomization in Online Computation

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

  2012cites this paper
• Security proofs in number theoretic cryptography

  2012cites this paper
• Lattice-based Cryptanalysis using Unravelled Linearization

  2011cites this paper
• The Leakage-Resilience Limit of a Computational Problem Is Equal to Its Unpredictability Entropy

  2011cites this paper
• Generalized Security Analysis of the Random Key Bits Leakage Attack

  2011cites this paper
• Reconstruction and Error Correction of RSA Secret Parameters from the MSB Side

  2011cites this paper
• Implicit Factoring with Shared Most Significant and Middle Bits

  2010cites this paper
• Using LLL-Reduction for Solving RSA and Factorization Problems

  2010cites this paper
• Factoring RSA Modulus Using Prime Reconstruction from Random Known Bits

  2010cites this paper
• Correcting Errors in RSA Private Keys

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

  2010cites this paper
• Sufficient conditions for factoring a class of large integers

  2010influential citation
• Lattice-based RSA Key Reconstruction from Randomly Scattered Bits

  2010influential citation
• Robustness of the Learning with Errors Assumption

  2010cites this paper
• Application of bio-inspired algorithm to the problem of integer factorisation

  2010cites this paper
• Speeding Up Bipartite Modular Multiplication

  2010cites this paper
• Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods

  2010cites this paper
• Speeding Up Barrett and Montgomery Modular Multiplications

  2009cites this paper
• Factoring Unbalanced Moduli with Known Bits

  2009cites this paper
• Simple Backdoors on RSA Modulus by Using RSA Vulnerability

  2009cites this paper
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

  2009influential citation
• Further results on implicit factoring in polynomial time

  2009cites this paper
• Public-Key Cryptosystems Resilient to Key Leakage

  2009influential citation
• Reducing lattice bases to find small-height values of univariate polynomials

  2008influential citation
• Improved RSA Private Key Reconstruction for Cold Boot Attacks

  2008cites this paper
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits

  2008cites this paper
• Two mathematical security aspects of the rsa cryptosystem: signature padding schemes and key generation with a backdoor

  2008cites this paper
• On Factoring Arbitrary Integers with Known Bits

  2007cites this paper
• An Algorithm for Finding Small Roots of Multivariate Polynomials over the Integers

  2007cites this paper
• List Decoding Interleaved and Folded

  2006cites this paper
• Integer Factoring with Extra Information

  2006influential citation
• A Comprehensive Study of Backdoors for RSA Key Generation

  2006cites this paper
• Cryptanalysis of Koyama Scheme

  2006cites this paper
• Simple Backdoors for RSA Key Generation

  2003cites this paper
• On Factoring Integers and Evaluating Discrete Logarithms

  2003cites this paper
• Finding a Small Root of a Bivariate Integer Equation ; Factoring with High Bits Known

  2002cites this paper
• A distributed key generation technique for public key infrastructures

  2000cites this paper
• Towards a scalable PKI for electronic commerce systems

  1999cites this paper
• Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities

  1997cites this paper
• Sparse RSA Secret Keys and Their GenerationChae

  1996cites this paper
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known

  1996cites this paper
• Attacks on the HKM/HFX Cryptosystem

  1996cites this paper
• Short RSA keys and their generation

  1995cites this paper
• On the oracle complexity of factoring integers

  1995influential citation
• The Discrete Logarithm Modulo a Composite Hides O(n) Bits

  1993cites this paper
• Factoring with an Oracle

  1992cites this paper
• Constructive complexity

  1991cites this paper
• The discrete log is very discreet

  1990cites this paper
• Protecting against Abuses of Cryptosystems in Particular in the Context of Verification of Peace Treaties (Extended Abstract)

  1990cites this paper
• Abuses in Cryptography and How to Fight Them

  1988cites this paper
• The Bit Security of Modular Squaring Given Partial Factorization of the Modulos

  1985cites this paper