Cryptanalysis of short secret exponents modulo RSA primes

@article{Chen2004CryptanalysisOS,
  title={Cryptanalysis of short secret exponents modulo RSA primes},
  author={Chien-Yuan Chen and Cheng-Yuan Ku and David C. Yen},
  journal={Inf. Sci.},
  year={2004},
  volume={160},
  pages={225-233}
}
In this manuscript, one way to attack on the short secret exponent dq modulo a larger RSA prime q is presented. When dq < (2p/3q)½ and e < (pq)½, dq can be discovered from the continued fraction of e/pq, where e and pq denote the public exponent and the modulus, correspondingly. Furthermore, the same way to attack on an unbalanced RSA is also discussed. According to cryptanalysis presented in this study, the unbalanced RSA will be resolved if dq < (2/3)½ q4/9. 

Tables and Topics from this paper.

Citations

Publications citing this paper.

References

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

Cryptanalysis of short RSA secret exponents

  • IEEE Trans. Information Theory
  • 1990
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL

Security paradoxes: how improving a cryptosystem may weaken it

M. Joye, J. J. Quisquater, S. M. Yen, M. Yung
  • in: Proceedings of The Ninth National Conference on Information Security, Taiwan
  • 1999
VIEW 1 EXCERPT

Cryptanalysis of ‘Less Short’ RSA Secret Exponents

  • Applicable Algebra in Engineering, Communication and Computing
  • 1997
VIEW 1 EXCERPT

RSA for paranoids

A. Shamir
  • Cryptobytes 1 (3)
  • 1995
VIEW 3 EXCERPTS