Partial key exposure attacks on RSA up to full size exponents

  • Authors:
  • Matthias Ernst;Ellen Jochemsz;Alexander May;Benne de Weger

  • Affiliations:
  • Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands

  • Venue:
  • EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present several attacks on RSA that factor the modulus in polynomial time under the condition that a fraction of the most significant bits or least significant bits of the private exponent is available to the attacker. Our new attacks on RSA are the first attacks of this type that work up to full size public or private exponent.