Fixed points of the RSA encryption algorithm
A Chmielowiec - Theoretical computer science, 2010 - Elsevier
Theoretical computer science, 2010•Elsevier
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.
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.
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.
Elsevier
Résultat de recherche le plus pertinent Voir tous les résultats