TL;DR
This paper analyzes the fixed points of order K in the RSA cryptosystem, providing a formula to count them and solving a previously open problem in the field.
Contribution
It introduces a computational formula for the number of fixed points of order K in RSA, advancing understanding of its dynamical properties.
Findings
Derived a formula for fixed points of order K in RSA
Solved an open problem regarding RSA fixed points
Enhanced understanding of RSA's dynamical structure
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 order of the RSA. Thus, the problem in [8, 9] has been solved.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Coding theory and cryptography · Cryptographic Implementations and Security