# Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack

@inproceedings{Sun2007EstimatingTP,
title={Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack},
author={Hung-Min Sun and Mu-En Wu and Yao-Hsin Chen},
booktitle={ACNS},
year={2007}
}
• Published in ACNS 2007
• Mathematics, Computer Science
• In the RSA system, balanced modulus Ndenotes a product of two large prime numbers pand q, where q " , and are denoted as p E and q E . Thus p E and q E can be adopted to estimate p+ qmore accurately than by simply adopting $2\sqrt{N}$. In addition, we show that the Verheul and Tilborg's extension of the Wiener attack can be considered to be brute-guessing for the MSBs of p+ q. Comparing with their work, EPF can extend the Wiener attack to reduce the cost of exhaustive-searching for 2r+ 8 bits… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

## PARTIAL KEY EXPOSURE ATTACKS ON RSA AND ITS VARIANT BY GUESSING A FEW BITS OF ONE OF THE PRIME FACTORS

• Mathematics
• 2009
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

## An Attack on Small Private Keys of RSA Based on Euclidean Algorithm

VIEW 1 EXCERPT
CITES BACKGROUND

## An Attack Bound for Small Multiplicative Inverse of φ(N) mod e with a Composed Prime Sum p + q Using Sublattice Based Techniques

• Mathematics, Computer Science
• Cryptography
• 2018

## Cryptanalysis of RSA with Small Multiplicative Inverse of (p − 1) or (q − 1) Modulo e

VIEW 2 EXCERPTS
CITES BACKGROUND

## On the Improvement of Wiener Attack on RSA with Small Private Exponent

• Medicine
• TheScientificWorldJournal
• 2014
VIEW 1 EXCERPT
CITES RESULTS

## On the improvement of Fermat factorization using a continued fraction technique

• Computer Science
• Future Gener. Comput. Syst.
• 2014
VIEW 1 EXCERPT
CITES METHODS

## Another Generalization of Weak Keys in RSA with Prime Sharing LSBs

• Mathematics
• 2012
VIEW 2 EXCERPTS
CITES BACKGROUND & METHODS

## Minkowski sum based lattice construction for solving simultaneous modular equations and applications to RSA

• Yoshinori Aono
• Computer Science, Mathematics
• IACR Cryptology ePrint Archive
• 2012

## A Note on Factoring α-LSBS Moduli

• Mathematics
• 2009
VIEW 1 EXCERPT
CITES METHODS

## A variant of Wiener’s attack on RSA

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

## Cryptanalysis of ‘Less Short’ RSA Secret Exponents

• Mathematics, Computer Science
• Applicable Algebra in Engineering, Communication and Computing
• 1997
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

## Cryptanalysis of RSA with short secret-exponents

• M. J. Wiener
• IEEE Trans. on Information Theory, Vol. 36, pp.553-558
• 1990
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

## Fast Variants of RSA

VIEW 1 EXCERPT

## RSA with Balanced Short Exponents and Its Application to Entity Authentication

• Mathematics, Computer Science
• Public Key Cryptography
• 2005
VIEW 1 EXCERPT

## The better bound of private key in RSA with unbalanced primes

• Computer Science, Mathematics
• Appl. Math. Comput.
• 2003
VIEW 1 EXCERPT

## Cryptanalysis of RSA with Small Prime Difference

• Benne de Weger
• Computer Science, Mathematics
• Applicable Algebra in Engineering, Communication and Computing
• 2002
VIEW 1 EXCERPT

## Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt '99

• Computer Science
• ASIACRYPT
• 2000
VIEW 1 EXCERPT

## Cryptanalysis of RSA with Private Key d Less Than N 0

VIEW 1 EXCERPT

## On the Design of RSA With Short Secret Exponent

• Mathematics, Computer Science
• J. Inf. Sci. Eng.
• 1999
VIEW 1 EXCERPT

## TWENTY YEARS OF ATTACKS ON THE RSA CRYPTOSYSTEM

VIEW 1 EXCERPT