Fixed points of the RSA encryption algorithm |
| |
| Authors: | Andrzej Chmielowiec |
| |
| Affiliation: | Institute of Fundamental Technological Research, Polish Academy of Sciences, Pawinskiego 5B, 02-106 Warsaw, Poland |
| |
| 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(ln2n), and the probability of finding such a point is O(ln2n/n). Thus, these values are really negligible, which had been intuitively expected. |
| |
| Keywords: | Cryptography RSA cryptosystem Fixed point Chinese Remainder Theorem (CRT) Greatest common divisor (GCD) |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
