Note: Fixed points of the RSA encryption algorithm

Authors:
Andrzej Chmielowiec
Affiliations:
Institute of Fundamental Technological Research, Polish Academy of Sciences, Pawinskiego 5B, 02-106 Warsaw, Poland
Venue:
Theoretical Computer Science
Year:
2010

Citing 1
Cited 1

On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA

Information Processing Letters

Note: A note on the average number of RSA fixed points

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper the problem of the number of fixed points for an RSA algorithm is considered. This is an important question from the point of view of any cryptosystem. We have estimated the expected value of this number for randomly chosen RSA parameters. It turned out that it is O(ln^2n), and the probability of finding such a point is O(ln^2n/n). Thus, these values are really negligible, which had been intuitively expected.