On Fixed Points of Order K of RSA
classification
🧮 math.NT
math.DS
keywords
fixedorderpointsanalysisbeencomputationalcryptosystemdynamical
read the original abstract
In this paper, we gave a preliminary dynamical analysis on the RSA cryptosystem and obtained a computational formulae of the number of the fixed points of $k$ order of the RSA. Thus, the problem in [8, 9] has been solved.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.