Properties of the RSA Cryptosystem

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


This chapter surveys the most important properties of the RSA encryption function. Most theorems are “bad news” for a cryptanalyst trying to break the RSA encryption system, showing that several proposed attacks will not work in practice. The results stated in this chapter provide further evidence that the RSA permutation might actually be a one-way function.


Chinese Remainder Theorem Euclidean Algorithm Large Prime Factor Jacobi Symbol Probabilistic Polynomial Time Algorithm 
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