Cryptanalysis of RSA with Small Prime Difference

@article{Weger2002CryptanalysisOR,
  title={Cryptanalysis of RSA with Small Prime Difference},
  author={Benne de Weger},
  journal={Applicable Algebra in Engineering, Communication and Computing},
  year={2002},
  volume={13},
  pages={17-28}
}
  • B. D. Weger
  • Published 1 April 2002
  • Mathematics, Computer Science
  • Applicable Algebra in Engineering, Communication and Computing
 We show that choosing an RSA modulus with a small difference of its prime factors yields improvements on the small private exponent attacks of Wiener and Boneh-Durfee. 

Figures and Topics from this paper

An algorithm to obtain an RSA modulus with a large private key
Sufficient conditions are obtained on the prime factors of an RSA modulus in order to avoid Wiener and Boneh-Durfee attacks. The public exponent can be chosen arbitrarily.
Small Private-Exponent Attack on RSA with Primes Sharing Bits
We show in this paper that if the primes share their some bits (e.g. Least-Significant bits), RSA system with small private-exponent is much more vulnerable to the Boneh-Durfee Attack.
Cryptanalysis of RSA with Small Prime Difference using Unravelled Linearization
In 2002, de Weger showed that choosing an RSA modulus with a small difference of primes improves the attack given by Boneh-Durfee. For this attack, de Weger used the complicated geometrical
De Weger ’ s attack on RSA small prime difference :
In 2002, de Weger showed that choosing an RSA modulus with a small difference of primes improves the attack given by Boneh-Durfee. For this attack, de Weger used the complicated geometrical
Partial Key Exposure Attacks on RSA up to Full Size Exponents
TLDR
These new attacks on RSA are the first attacks of this type that work up to full size public or private exponent, and factor the modulus in polynomial time.
Publishing Upper Half of RSA Decryption Exponent
TLDR
This paper proposes certain schemes to exploit the top half of the decryption exponent d, which can be narrowed down within a small search space, towards efficient RSA decryption.
Factoring RSA moduli when a message is close to a multiple of the primes
TLDR
It is shown that it is possible to factor N in polynomial time in when a low public exponent is used.
Factoring multi power RSA moduli with a class of secret exponents
Abstract In this paper, we consider the RSA variant based on the key equation ed ≡ 1 (mod φ(N)) where N = prq, r ≥ 2. We show that if the secret exponent d is close to any multiple of the prime
The Monte Carlo Type Method of Attack on the RSA Cryptosystem
TLDR
The possibility of determination of the secret key of an RSA cryptosystem by means of the Monte Carlo method applied to the continued fraction method is studied.
Factoring RSA moduli with primes sharing bits in the middle
  • Omar Akchiche, O. Khadir
  • Mathematics, Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 2017
TLDR
This work addresses the problem of factoring a large RSA modulus $$N=pq$$N= pq with p and q sharing a portion of bits in the middle and suggests that such integers are not appropriate for cryptographic purposes.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 14 REFERENCES
New Results on the Cryptanalysis of Low Exponent Rsa
We show that if the private exponent d used in the RSA system is less than N 0:292 then the system is insecure. This is the rst improvement over an old result of Wiener showing that when d < N 0:25
Fast Generation Of Random, Strong RSA Primes
A number of cryptographic standards currently under development call for the use of strong primes in the generation of an RSA key. This paper suggests a fast way of generating random strong primes
Cryptanalysis of RSA with private key d less than N0.292
We show that if the private exponent d used in the RSA (Rivest-Shamir-Adleman (1978)) public-key cryptosystem is less than N/sup 0.292/ then the system is insecure. This is the first improvement over
Finding Small Roots of Univariate Modular Equations Revisited
TLDR
An alternative technique for finding small roots of univariate modular equations is described and it is compared with that taken in (Coppersmith, 1996), which links the concept of the dual lattice to the LLL algorithm.
Cryptanalysis of ‘Less Short’ RSA Secret Exponents
  • E. Verheul, H. V. Tilborg
  • Mathematics, Computer Science
    Applicable Algebra in Engineering, Communication and Computing
  • 1997
TLDR
Here, it is described a general method to compute the CF-convergents of the continued fraction expansion of the same number as in Wiener up to the point where the denominator of the CF -convergent exceeds approximately n1/4.
Finding a Small Root of a Univariate Modular Equation
We show how to solve a polynomial equation (mod N) of degree k in a single variable x, as long as there is a solution smaller than N1/k. We give two applications to RSA encryption with exponent 3.
Cryptanalysis of short RSA secret exponents
  • M. Wiener
  • Mathematics, Computer Science
    IEEE Trans. Inf. Theory
  • 1990
TLDR
A cryptanalytic attack on the use of short RSA secret exponents is described, which poses no threat to the normal case of RSA where the secret exponent is approximately the same size as the modulus.
Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
TLDR
A method to solve integer polynomial equations in two variables, provided that the solution is suitably bounded, and how to find the factors of N = PQ if the authors are given the high order ((1/4) log2 N) bits of P is presented.
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of
[서평]「Applied Cryptography」
The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical
...
1
2
...