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 ( log n ) 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 ( ( log n ) 3 ) .
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
