A note on the average number of RSA fixed points
In: Theoretical computer science, Jg. 412 (2011), Heft 35, S. 4729-4737
Online
academicJournal
- print, 7 ref
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).
Titel: |
A note on the average number of RSA fixed points
|
---|---|
Autor/in / Beteiligte Person: | CHAE HOON, LIM |
Link: | |
Zeitschrift: | Theoretical computer science, Jg. 412 (2011), Heft 35, S. 4729-4737 |
Veröffentlichung: | Oxford: Elsevier, 2011 |
Medientyp: | academicJournal |
Umfang: | print, 7 ref |
ISSN: | 0304-3975 (print) |
Schlagwort: |
|
Sonstiges: |
|