Low-Exponent RSA

  • Stefan Katzenbeisser
Part of the Advances in Information Security book series (ADIS, volume 3)


Different to the theorems of the previous chapters which were “bad news” for a cryptanalyst, we present some “bad news” for the cryptographer in this chapter. All theorems show weaknesses of special instances of the RSA cryptosystem, namely systems that use either a small encryption or decryption key.


Lattice Reduction Continue Fraction Expansion Sylvester Matrix Public Exponent Integer Linear Combination 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Stefan Katzenbeisser
    • 1
  1. 1.Vienna University of TechnologyAustria

Personalised recommendations