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}
}
  • Hung-Min Sun, Mu-En Wu, Yao-Hsin Chen
  • 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

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

    VIEW 1 EXCERPT
    CITES BACKGROUND

    On the improvement of Fermat factorization using a continued fraction technique

    VIEW 1 EXCERPT
    CITES METHODS

    A Note on Factoring α-LSBS Moduli

    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

    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

    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

    On the Design of RSA With Short Secret Exponent

    VIEW 1 EXCERPT