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

Authors:
Chae Hoon Lim
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2011

Citing 2
Cited 0

A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Note: Fixed points of the RSA encryption algorithm

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

Recently, Chmielowiec (2010) [3] studied an upper bound for the average number of fixed points in RSA encryption and asserted that it is on the order of (logn)^2 for randomly chosen RSA parameters (n,e). In this paper, we point out some error in his estimation and present detailed procedures for correct evaluation. It is shown that the expected number of RSA fixed points is in fact O((logn)^3).