On Fixed Points of Order K of RSA

MaRDI QIDQ3014820zbMATH OpenFDO

Authors Shaohua Zhang

Publication date 19 July 2011

Full work available at URL https://arxiv.org/abs/0907.4096

zbMATH Keywords

dynamical analysisfixed points attackfixed points of order \(k\)

Mathematics Subject Classification ID

Cryptography (94A60)

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.

Recommendations

• A note on the average number of RSA fixed points
• Fixed points of the RSA encryption algorithm
• An approximate expression related with RSA fixed points
• A note on low order assumptions in RSA groups
• On RSA moduli with prescribed bit patterns
• On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
• Public Key Cryptography - PKC 2005
• On the uniformity of distribution of the RSA pairs
• On the number of sparse RSA exponents

Cited in

(3)

• Fixed points of the RSA encryption algorithm
• An approximate expression related with RSA fixed points
• A note on the average number of RSA fixed points

This page was built for publication: On Fixed Points of Order K of RSA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014820)